./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_fillercodesize_ps-cn-10_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eeb14fc4af4141dc041f376e493f1f94c8be383db2e49ff3554ffa1b21cacd5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:06:40,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:06:40,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:06:40,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:06:40,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:06:40,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:06:40,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:06:40,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:06:40,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:06:40,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:06:40,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:06:40,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:06:40,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:06:40,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:06:40,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:06:40,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:06:40,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:06:40,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:06:40,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:06:40,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:06:40,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:06:40,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:06:40,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:06:40,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:06:40,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:06:40,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:06:40,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:06:40,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:06:40,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:06:40,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:06:40,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:06:40,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:06:40,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:40,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:06:40,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:06:40,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:06:40,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:06:40,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:06:40,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:06:40,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:06:40,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:06:40,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:06:40,102 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eeb14fc4af4141dc041f376e493f1f94c8be383db2e49ff3554ffa1b21cacd5 [2024-10-11 08:06:40,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:06:40,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:06:40,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:06:40,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:06:40,341 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:06:40,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-11 08:06:41,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:06:41,695 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:06:41,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-11 08:06:41,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7837aa542/9e009eeba1694e0992058726b2e5f23b/FLAGa50fddf40 [2024-10-11 08:06:42,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7837aa542/9e009eeba1694e0992058726b2e5f23b [2024-10-11 08:06:42,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:06:42,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:06:42,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:42,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:06:42,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:06:42,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d375b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42, skipping insertion in model container [2024-10-11 08:06:42,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:06:42,232 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_fillercodesize_ps-cn-10_file-53.i[915,928] [2024-10-11 08:06:42,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:42,285 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:06:42,295 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_fillercodesize_ps-cn-10_file-53.i[915,928] [2024-10-11 08:06:42,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:42,348 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:06:42,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42 WrapperNode [2024-10-11 08:06:42,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:42,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:42,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:06:42,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:06:42,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,387 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 228 [2024-10-11 08:06:42,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:42,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:06:42,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:06:42,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:06:42,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,429 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:06:42,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:06:42,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:06:42,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:06:42,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:06:42,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (1/1) ... [2024-10-11 08:06:42,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:42,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:06:42,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:06:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:06:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:06:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:06:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:06:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:06:42,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:06:42,598 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:06:42,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:06:42,896 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-11 08:06:42,896 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:06:42,924 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:06:42,925 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:06:42,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:42 BoogieIcfgContainer [2024-10-11 08:06:42,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:06:42,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:06:42,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:06:42,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:06:42,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:06:42" (1/3) ... [2024-10-11 08:06:42,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8ff28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:42, skipping insertion in model container [2024-10-11 08:06:42,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:42" (2/3) ... [2024-10-11 08:06:42,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8ff28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:42, skipping insertion in model container [2024-10-11 08:06:42,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:42" (3/3) ... [2024-10-11 08:06:42,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-11 08:06:42,943 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:06:42,943 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:06:43,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:06:43,038 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;@891e4ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:06:43,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:06:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:06:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 08:06:43,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:43,055 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:43,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:43,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:43,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1041261698, now seen corresponding path program 1 times [2024-10-11 08:06:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:43,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586616696] [2024-10-11 08:06:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:06:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:06:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:06:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:06:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:06:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:43,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586616696] [2024-10-11 08:06:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586616696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:43,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:06:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339030680] [2024-10-11 08:06:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:43,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:06:43,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:06:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:06:43,495 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:06:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:43,530 INFO L93 Difference]: Finished difference Result 175 states and 304 transitions. [2024-10-11 08:06:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:06:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-10-11 08:06:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:43,540 INFO L225 Difference]: With dead ends: 175 [2024-10-11 08:06:43,541 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 08:06:43,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:06:43,549 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-11 08:06:43,550 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-11 08:06:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 08:06:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 08:06:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:06:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-10-11 08:06:43,589 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 175 [2024-10-11 08:06:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:43,589 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-10-11 08:06:43,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:06:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-10-11 08:06:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 08:06:43,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:43,592 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:43,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:06:43,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1166707974, now seen corresponding path program 1 times [2024-10-11 08:06:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366105479] [2024-10-11 08:06:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:06:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:06:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:06:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:06:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:06:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:43,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:43,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366105479] [2024-10-11 08:06:43,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366105479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:43,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:43,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:06:43,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510512472] [2024-10-11 08:06:43,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:06:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:43,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:06:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:43,867 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:43,971 INFO L93 Difference]: Finished difference Result 250 states and 385 transitions. [2024-10-11 08:06:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:06:43,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2024-10-11 08:06:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:43,977 INFO L225 Difference]: With dead ends: 250 [2024-10-11 08:06:43,978 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 08:06:43,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:43,980 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 113 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:43,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 337 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:06:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 08:06:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-10-11 08:06:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:06:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 248 transitions. [2024-10-11 08:06:44,017 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 248 transitions. Word has length 175 [2024-10-11 08:06:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:44,019 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 248 transitions. [2024-10-11 08:06:44,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 248 transitions. [2024-10-11 08:06:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 08:06:44,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:44,021 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:44,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:06:44,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash -332924040, now seen corresponding path program 1 times [2024-10-11 08:06:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:44,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481676094] [2024-10-11 08:06:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:06:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:06:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:06:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:06:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:06:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:44,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:44,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481676094] [2024-10-11 08:06:44,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481676094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:44,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:44,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:06:44,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914970064] [2024-10-11 08:06:44,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:44,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:06:44,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:06:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:06:44,349 INFO L87 Difference]: Start difference. First operand 162 states and 248 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:44,600 INFO L93 Difference]: Finished difference Result 535 states and 813 transitions. [2024-10-11 08:06:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:06:44,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-11 08:06:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:44,609 INFO L225 Difference]: With dead ends: 535 [2024-10-11 08:06:44,609 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 08:06:44,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:06:44,611 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 173 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:44,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 345 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:06:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 08:06:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 358. [2024-10-11 08:06:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 241 states have (on average 1.3278008298755186) internal successors, (320), 241 states have internal predecessors, (320), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-11 08:06:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 544 transitions. [2024-10-11 08:06:44,654 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 544 transitions. Word has length 176 [2024-10-11 08:06:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:44,655 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 544 transitions. [2024-10-11 08:06:44,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 544 transitions. [2024-10-11 08:06:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 08:06:44,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:44,657 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:44,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:06:44,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:44,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1197858128, now seen corresponding path program 1 times [2024-10-11 08:06:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:44,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882596586] [2024-10-11 08:06:44,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:06:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:06:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:06:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:06:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:06:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882596586] [2024-10-11 08:06:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882596586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:44,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:06:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824329133] [2024-10-11 08:06:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:44,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:06:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:06:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:44,860 INFO L87 Difference]: Start difference. First operand 358 states and 544 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:44,908 INFO L93 Difference]: Finished difference Result 905 states and 1380 transitions. [2024-10-11 08:06:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:06:44,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-11 08:06:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:44,915 INFO L225 Difference]: With dead ends: 905 [2024-10-11 08:06:44,916 INFO L226 Difference]: Without dead ends: 548 [2024-10-11 08:06:44,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:44,917 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 74 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:44,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 251 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:06:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-11 08:06:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2024-10-11 08:06:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 371 states have (on average 1.3234501347708896) internal successors, (491), 371 states have internal predecessors, (491), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-11 08:06:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 827 transitions. [2024-10-11 08:06:44,955 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 827 transitions. Word has length 177 [2024-10-11 08:06:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:44,956 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 827 transitions. [2024-10-11 08:06:44,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 827 transitions. [2024-10-11 08:06:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 08:06:44,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:44,958 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:06:44,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1078567188, now seen corresponding path program 1 times [2024-10-11 08:06:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:44,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069240677] [2024-10-11 08:06:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:06:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:06:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:06:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:06:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:06:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069240677] [2024-10-11 08:06:45,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069240677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:45,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:06:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885061491] [2024-10-11 08:06:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:45,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:06:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:06:45,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:45,067 INFO L87 Difference]: Start difference. First operand 546 states and 827 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:45,204 INFO L93 Difference]: Finished difference Result 1597 states and 2424 transitions. [2024-10-11 08:06:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:06:45,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-11 08:06:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:45,209 INFO L225 Difference]: With dead ends: 1597 [2024-10-11 08:06:45,209 INFO L226 Difference]: Without dead ends: 1052 [2024-10-11 08:06:45,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:45,211 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 127 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:45,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 349 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:06:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-10-11 08:06:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 558. [2024-10-11 08:06:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 383 states have (on average 1.3133159268929504) internal successors, (503), 383 states have internal predecessors, (503), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-11 08:06:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 839 transitions. [2024-10-11 08:06:45,285 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 839 transitions. Word has length 178 [2024-10-11 08:06:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:45,286 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 839 transitions. [2024-10-11 08:06:45,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 839 transitions. [2024-10-11 08:06:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 08:06:45,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:45,287 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:45,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:06:45,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:45,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash 685540178, now seen corresponding path program 1 times [2024-10-11 08:06:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615413696] [2024-10-11 08:06:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:06:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:06:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:06:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:06:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:06:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 08:06:45,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615413696] [2024-10-11 08:06:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615413696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:06:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296977602] [2024-10-11 08:06:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:45,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:45,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:45,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:06:45,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:06:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:45,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 08:06:45,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:06:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-10-11 08:06:46,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:06:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 08:06:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296977602] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:06:46,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:06:46,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2024-10-11 08:06:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807890674] [2024-10-11 08:06:46,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:06:46,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 08:06:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 08:06:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-10-11 08:06:46,528 INFO L87 Difference]: Start difference. First operand 558 states and 839 transitions. Second operand has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-11 08:06:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:48,342 INFO L93 Difference]: Finished difference Result 1828 states and 2685 transitions. [2024-10-11 08:06:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-11 08:06:48,343 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 178 [2024-10-11 08:06:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:48,348 INFO L225 Difference]: With dead ends: 1828 [2024-10-11 08:06:48,348 INFO L226 Difference]: Without dead ends: 1271 [2024-10-11 08:06:48,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 08:06:48,351 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1102 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 752 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:48,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 1223 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [752 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 08:06:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-10-11 08:06:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 570. [2024-10-11 08:06:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 389 states have (on average 1.2930591259640103) internal successors, (503), 389 states have internal predecessors, (503), 168 states have call successors, (168), 12 states have call predecessors, (168), 12 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-11 08:06:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 839 transitions. [2024-10-11 08:06:48,422 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 839 transitions. Word has length 178 [2024-10-11 08:06:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:48,422 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 839 transitions. [2024-10-11 08:06:48,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-11 08:06:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 839 transitions. [2024-10-11 08:06:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 08:06:48,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:48,424 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:48,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:06:48,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:48,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:48,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1370107237, now seen corresponding path program 1 times [2024-10-11 08:06:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:48,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734433640] [2024-10-11 08:06:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:06:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:06:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:06:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:06:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:06:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:48,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734433640] [2024-10-11 08:06:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734433640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:48,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:48,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:06:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005530721] [2024-10-11 08:06:48,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:48,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:06:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:48,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:06:48,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:06:48,825 INFO L87 Difference]: Start difference. First operand 570 states and 839 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:48,923 INFO L93 Difference]: Finished difference Result 572 states and 840 transitions. [2024-10-11 08:06:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:06:48,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-11 08:06:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:48,925 INFO L225 Difference]: With dead ends: 572 [2024-10-11 08:06:48,925 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 08:06:48,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:06:48,927 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:48,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:06:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 08:06:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-11 08:06:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:06:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 286 transitions. [2024-10-11 08:06:48,949 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 286 transitions. Word has length 178 [2024-10-11 08:06:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:48,949 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 286 transitions. [2024-10-11 08:06:48,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 286 transitions. [2024-10-11 08:06:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 08:06:48,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:48,950 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:48,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 08:06:48,951 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:48,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash 551129246, now seen corresponding path program 1 times [2024-10-11 08:06:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:48,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141965417] [2024-10-11 08:06:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:06:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:06:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:06:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 08:06:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:06:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:06:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:06:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:06:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:06:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:06:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:06:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:06:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:06:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:49,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141965417] [2024-10-11 08:06:49,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141965417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:49,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:49,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:06:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781896303] [2024-10-11 08:06:49,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:49,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:06:49,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:06:49,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:06:49,128 INFO L87 Difference]: Start difference. First operand 199 states and 286 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:49,277 INFO L93 Difference]: Finished difference Result 399 states and 572 transitions. [2024-10-11 08:06:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:06:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-10-11 08:06:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:49,280 INFO L225 Difference]: With dead ends: 399 [2024-10-11 08:06:49,280 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 08:06:49,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-11 08:06:49,281 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 64 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:49,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 262 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:06:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 08:06:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-10-11 08:06:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:06:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 285 transitions. [2024-10-11 08:06:49,312 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 285 transitions. Word has length 179 [2024-10-11 08:06:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:49,313 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 285 transitions. [2024-10-11 08:06:49,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 285 transitions. [2024-10-11 08:06:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 08:06:49,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:49,315 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:49,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 08:06:49,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:49,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash -258217380, now seen corresponding path program 1 times [2024-10-11 08:06:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:49,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249338731] [2024-10-11 08:06:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:06:49,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797999569] [2024-10-11 08:06:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:49,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:49,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:49,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:06:49,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:06:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:06:49,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:06:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:06:49,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:06:49,699 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:06:49,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:06:49,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:06:49,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:06:49,906 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:50,014 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:06:50,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:06:50 BoogieIcfgContainer [2024-10-11 08:06:50,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:06:50,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:06:50,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:06:50,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:06:50,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:42" (3/4) ... [2024-10-11 08:06:50,019 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:06:50,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:06:50,021 INFO L158 Benchmark]: Toolchain (without parser) took 7937.04ms. Allocated memory was 163.6MB in the beginning and 297.8MB in the end (delta: 134.2MB). Free memory was 131.7MB in the beginning and 150.7MB in the end (delta: -19.0MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2024-10-11 08:06:50,021 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:06:50,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.15ms. Allocated memory is still 163.6MB. Free memory was 131.7MB in the beginning and 115.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:06:50,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.65ms. Allocated memory is still 163.6MB. Free memory was 115.6MB in the beginning and 112.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:06:50,022 INFO L158 Benchmark]: Boogie Preprocessor took 67.04ms. Allocated memory is still 163.6MB. Free memory was 112.5MB in the beginning and 107.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 08:06:50,022 INFO L158 Benchmark]: RCFGBuilder took 469.04ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 79.0MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 08:06:50,022 INFO L158 Benchmark]: TraceAbstraction took 7089.50ms. Allocated memory was 163.6MB in the beginning and 297.8MB in the end (delta: 134.2MB). Free memory was 77.9MB in the beginning and 151.7MB in the end (delta: -73.8MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-10-11 08:06:50,022 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 297.8MB. Free memory was 151.7MB in the beginning and 150.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:06:50,024 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.13ms. Allocated memory is still 119.5MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.15ms. Allocated memory is still 163.6MB. Free memory was 131.7MB in the beginning and 115.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.65ms. Allocated memory is still 163.6MB. Free memory was 115.6MB in the beginning and 112.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.04ms. Allocated memory is still 163.6MB. Free memory was 112.5MB in the beginning and 107.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 469.04ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 79.0MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7089.50ms. Allocated memory was 163.6MB in the beginning and 297.8MB in the end (delta: 134.2MB). Free memory was 77.9MB in the beginning and 151.7MB in the end (delta: -73.8MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 297.8MB. Free memory was 151.7MB in the beginning and 150.7MB 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 162, overapproximation of shiftLeft at line 76, overapproximation of someBinaryArithmeticFLOAToperation at line 82, overapproximation of someUnaryFLOAToperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] signed short int var_1_25 = 5; [L41] unsigned short int var_1_26 = 500; [L42] unsigned char var_1_27 = 1; [L43] signed short int var_1_28 = -32; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 1; [L46] signed long int var_1_31 = -2; [L47] unsigned char var_1_32 = 32; [L48] unsigned char var_1_33 = 16; [L49] unsigned char var_1_34 = 1; [L50] unsigned char last_1_var_1_1 = 0; [L51] unsigned long int last_1_var_1_9 = 10; [L52] signed short int last_1_var_1_14 = 32; [L53] unsigned char last_1_var_1_16 = 1; [L54] signed char last_1_var_1_20 = 1; [L166] isInitial = 1 [L167] FCALL initially() [L168] COND TRUE 1 [L169] CALL updateLastVariables() [L155] last_1_var_1_1 = var_1_1 [L156] last_1_var_1_9 = var_1_9 [L157] last_1_var_1_14 = var_1_14 [L158] last_1_var_1_16 = var_1_16 [L159] last_1_var_1_20 = var_1_20 [L169] RET updateLastVariables() [L170] CALL updateVariables() [L111] var_1_8 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L112] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L113] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L113] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L114] var_1_11 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L115] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L116] var_1_12 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L117] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L118] var_1_13 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L119] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L120] var_1_15 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L121] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L122] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L122] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L123] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L124] var_1_17 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L125] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L126] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L126] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L127] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L127] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L128] var_1_18 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L129] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L130] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L131] var_1_19 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L132] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L133] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L134] var_1_21 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L135] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L136] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L136] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L137] var_1_25 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L138] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L139] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L139] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L140] var_1_27 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L141] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L142] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L142] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L143] var_1_28 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L144] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L145] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L145] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L146] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L146] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L147] var_1_30 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L148] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L149] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L149] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=16, var_1_34=1, var_1_8=1, var_1_9=10] [L150] var_1_33 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_34=1, var_1_8=1, var_1_9=10] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_34=1, var_1_8=1, var_1_9=10] [L152] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L170] RET updateVariables() [L171] CALL step() [L58] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L59] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=0, var_1_30=1, var_1_31=-2, var_1_32=32, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L64] var_1_29 = var_1_30 [L65] var_1_31 = var_1_24 [L66] var_1_32 = var_1_33 [L67] var_1_34 = var_1_30 [L68] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L69] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L70] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L75] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L76] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L76] COND FALSE !(stepLocal_6 <= (256u << last_1_var_1_16)) [L79] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L80] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L81] COND TRUE (! var_1_1) || stepLocal_4 [L82] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L90] var_1_20 = var_1_21 [L91] var_1_22 = var_1_12 [L92] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L93] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L96] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L96] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L97] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L102] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L103] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L104] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L105] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L171] RET step() [L172] CALL, EXPR property() [L162] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L162] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L162-L163] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L172] RET, EXPR property() [L172] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=1, var_1_17=10, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=-32767, var_1_25=-32767, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=1, var_1_30=1, var_1_31=-32767, var_1_32=0, var_1_33=0, var_1_34=1, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1777 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1775 mSDsluCounter, 3016 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1807 mSDsCounter, 930 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1701 IncrementalHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 930 mSolverCounterUnsat, 1209 mSDtfsCounter, 1701 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 910 GetRequests, 840 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=6, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1217 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1952 NumberOfCodeBlocks, 1952 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1762 ConstructedInterpolants, 0 QuantifiedInterpolants, 3477 SizeOfPredicates, 5 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 15012/15120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 08:06:50,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eeb14fc4af4141dc041f376e493f1f94c8be383db2e49ff3554ffa1b21cacd5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:06:51,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:06:51,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:06:51,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:06:51,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:06:51,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:06:51,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:06:51,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:06:51,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:06:51,977 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:06:51,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:06:51,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:06:51,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:06:51,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:06:51,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:06:51,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:06:51,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:06:51,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:06:51,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:06:51,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:06:51,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:06:51,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:06:51,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:06:51,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:06:51,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:06:51,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:06:51,986 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:06:51,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:06:51,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:06:51,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:06:51,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:06:51,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:06:51,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:06:51,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:06:51,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:51,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:06:51,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:06:51,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:06:51,988 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:06:51,988 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:06:51,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:06:51,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:06:51,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:06:51,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:06:51,989 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:06:51,989 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eeb14fc4af4141dc041f376e493f1f94c8be383db2e49ff3554ffa1b21cacd5 [2024-10-11 08:06:52,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:06:52,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:06:52,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:06:52,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:06:52,263 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:06:52,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-11 08:06:53,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:06:53,726 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:06:53,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-11 08:06:53,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6af9783df/9e74d8c907e047eda7cc8ed1db619311/FLAGb3cda3153 [2024-10-11 08:06:54,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6af9783df/9e74d8c907e047eda7cc8ed1db619311 [2024-10-11 08:06:54,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:06:54,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:06:54,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:54,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:06:54,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:06:54,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577e02da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54, skipping insertion in model container [2024-10-11 08:06:54,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:06:54,266 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_fillercodesize_ps-cn-10_file-53.i[915,928] [2024-10-11 08:06:54,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:54,345 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:06:54,357 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_fillercodesize_ps-cn-10_file-53.i[915,928] [2024-10-11 08:06:54,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:54,411 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:06:54,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54 WrapperNode [2024-10-11 08:06:54,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:54,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:54,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:06:54,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:06:54,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,464 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-11 08:06:54,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:54,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:06:54,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:06:54,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:06:54,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:06:54,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:06:54,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:06:54,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:06:54,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:06:54,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (1/1) ... [2024-10-11 08:06:54,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:54,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:54,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:06:54,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:06:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:06:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:06:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:06:54,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:06:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:06:54,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:06:54,657 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:06:54,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:06:55,140 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 08:06:55,140 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:06:55,193 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:06:55,193 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:06:55,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:55 BoogieIcfgContainer [2024-10-11 08:06:55,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:06:55,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:06:55,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:06:55,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:06:55,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:06:54" (1/3) ... [2024-10-11 08:06:55,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d4be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:55, skipping insertion in model container [2024-10-11 08:06:55,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:54" (2/3) ... [2024-10-11 08:06:55,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d4be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:55, skipping insertion in model container [2024-10-11 08:06:55,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:55" (3/3) ... [2024-10-11 08:06:55,201 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-53.i [2024-10-11 08:06:55,213 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:06:55,213 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:06:55,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:06:55,274 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;@6b9d00dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:06:55,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:06:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:06:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:06:55,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:55,295 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:55,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash 844942167, now seen corresponding path program 1 times [2024-10-11 08:06:55,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:06:55,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249678443] [2024-10-11 08:06:55,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:06:55,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:06:55,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:06:55,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:06:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:55,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:06:55,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:06:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-11 08:06:55,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:06:55,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:06:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249678443] [2024-10-11 08:06:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249678443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:55,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:55,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:06:55,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654331268] [2024-10-11 08:06:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:55,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:06:55,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:06:55,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:06:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:06:55,655 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:06:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:55,837 INFO L93 Difference]: Finished difference Result 139 states and 250 transitions. [2024-10-11 08:06:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:06:55,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-10-11 08:06:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:55,853 INFO L225 Difference]: With dead ends: 139 [2024-10-11 08:06:55,853 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 08:06:55,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:06:55,858 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:55,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:06:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 08:06:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-11 08:06:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:06:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2024-10-11 08:06:55,891 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 170 [2024-10-11 08:06:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:55,891 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2024-10-11 08:06:55,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:06:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2024-10-11 08:06:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:06:55,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:55,894 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:55,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 08:06:56,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:06:56,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:56,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1563857375, now seen corresponding path program 1 times [2024-10-11 08:06:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:06:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342648909] [2024-10-11 08:06:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:56,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:06:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:06:56,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:06:56,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:06:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:56,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:06:56,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:06:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:56,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:06:56,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:06:56,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342648909] [2024-10-11 08:06:56,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342648909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:56,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:56,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:06:56,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855609864] [2024-10-11 08:06:56,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:56,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:06:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:06:56,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:06:56,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:56,623 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:56,957 INFO L93 Difference]: Finished difference Result 203 states and 315 transitions. [2024-10-11 08:06:56,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:06:56,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-10-11 08:06:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:56,960 INFO L225 Difference]: With dead ends: 203 [2024-10-11 08:06:56,960 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 08:06:56,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:56,962 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:56,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 195 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:06:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 08:06:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-10-11 08:06:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:06:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2024-10-11 08:06:56,992 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 170 [2024-10-11 08:06:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:56,993 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2024-10-11 08:06:56,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:06:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2024-10-11 08:06:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:06:56,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:56,999 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:57,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:06:57,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:06:57,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:57,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1355097612, now seen corresponding path program 1 times [2024-10-11 08:06:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:06:57,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553577368] [2024-10-11 08:06:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:57,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:06:57,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:06:57,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:06:57,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 08:06:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:57,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:06:57,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:06:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-10-11 08:06:57,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:06:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 08:06:57,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:06:57,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553577368] [2024-10-11 08:06:57,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553577368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:06:57,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:06:57,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-10-11 08:06:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781234061] [2024-10-11 08:06:57,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:06:57,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 08:06:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:06:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 08:06:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:06:57,927 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-11 08:06:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:59,343 INFO L93 Difference]: Finished difference Result 426 states and 642 transitions. [2024-10-11 08:06:59,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 08:06:59,344 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 171 [2024-10-11 08:06:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:59,346 INFO L225 Difference]: With dead ends: 426 [2024-10-11 08:06:59,347 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 08:06:59,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2024-10-11 08:06:59,348 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 304 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:06:59,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 498 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 08:06:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 08:06:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 143. [2024-10-11 08:06:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:06:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2024-10-11 08:06:59,373 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 171 [2024-10-11 08:06:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:06:59,373 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2024-10-11 08:06:59,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-11 08:06:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2024-10-11 08:06:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:06:59,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:59,376 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:06:59,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 08:06:59,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:06:59,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:59,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1412355914, now seen corresponding path program 1 times [2024-10-11 08:06:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:06:59,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806879083] [2024-10-11 08:06:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:59,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:06:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:06:59,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:06:59,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 08:06:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:06:59,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:06:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:06:59,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:06:59,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:06:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806879083] [2024-10-11 08:06:59,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806879083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:59,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:59,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:06:59,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312744534] [2024-10-11 08:06:59,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:59,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:06:59,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:06:59,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:06:59,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:06:59,783 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:07:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:07:00,050 INFO L93 Difference]: Finished difference Result 361 states and 540 transitions. [2024-10-11 08:07:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:07:00,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-10-11 08:07:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:07:00,055 INFO L225 Difference]: With dead ends: 361 [2024-10-11 08:07:00,056 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 08:07:00,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:07:00,057 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 100 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:07:00,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 295 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:07:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 08:07:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 141. [2024-10-11 08:07:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:07:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2024-10-11 08:07:00,085 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 171 [2024-10-11 08:07:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:07:00,086 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2024-10-11 08:07:00,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:07:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2024-10-11 08:07:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:07:00,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:07:00,087 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:07:00,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 08:07:00,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:07:00,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:07:00,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:07:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash -45461988, now seen corresponding path program 1 times [2024-10-11 08:07:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:07:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864465175] [2024-10-11 08:07:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:07:00,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:07:00,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:07:00,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:07:00,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 08:07:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:07:00,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:07:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:07:00,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:07:00,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:07:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864465175] [2024-10-11 08:07:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864465175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:07:00,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:07:00,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:07:00,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612859188] [2024-10-11 08:07:00,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:07:00,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:07:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:07:00,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:07:00,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:07:00,993 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:07:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:07:01,508 INFO L93 Difference]: Finished difference Result 352 states and 524 transitions. [2024-10-11 08:07:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:07:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-10-11 08:07:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:07:01,520 INFO L225 Difference]: With dead ends: 352 [2024-10-11 08:07:01,520 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 08:07:01,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:07:01,522 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 52 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:07:01,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 344 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 08:07:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 08:07:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 196. [2024-10-11 08:07:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 105 states have (on average 1.2) internal successors, (126), 105 states have internal predecessors, (126), 84 states have call successors, (84), 6 states have call predecessors, (84), 6 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 08:07:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 294 transitions. [2024-10-11 08:07:01,550 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 294 transitions. Word has length 171 [2024-10-11 08:07:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:07:01,550 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 294 transitions. [2024-10-11 08:07:01,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:07:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 294 transitions. [2024-10-11 08:07:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:07:01,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:07:01,552 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:07:01,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 08:07:01,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:07:01,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:07:01,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:07:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash 931450851, now seen corresponding path program 1 times [2024-10-11 08:07:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:07:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553014986] [2024-10-11 08:07:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:07:01,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:07:01,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:07:01,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:07:01,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 08:07:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 08:07:01,931 INFO L278 TraceCheckSpWp]: Computing forward predicates...