./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-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:46:23,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:46:23,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:46:23,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:46:23,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:46:23,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:46:23,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:46:23,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:46:23,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:46:23,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:46:23,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:46:23,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:46:23,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:46:23,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:46:23,966 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:46:23,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:46:23,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:46:23,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:46:23,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:46:23,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:46:23,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:46:23,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:46:23,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:46:23,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:46:23,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:46:23,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:46:23,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:46:23,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:46:23,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:46:23,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:46:23,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:46:23,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:46:23,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:46:23,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:46:23,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:46:23,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:46:23,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:46:23,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:46:23,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:46:23,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:46:23,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:46:23,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:46:23,973 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 [2024-10-13 00:46:24,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:46:24,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:46:24,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:46:24,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:46:24,196 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:46:24,198 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-47.i [2024-10-13 00:46:25,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:46:25,639 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:46:25,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2024-10-13 00:46:25,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3def7a35/112f90f01db14e92a46cf3a56e7f798f/FLAG2ce7e2885 [2024-10-13 00:46:26,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3def7a35/112f90f01db14e92a46cf3a56e7f798f [2024-10-13 00:46:26,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:46:26,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:46:26,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:46:26,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:46:26,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:46:26,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@483511de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26, skipping insertion in model container [2024-10-13 00:46:26,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:46:26,200 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-47.i[915,928] [2024-10-13 00:46:26,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:46:26,268 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:46:26,277 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-47.i[915,928] [2024-10-13 00:46:26,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:46:26,326 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:46:26,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26 WrapperNode [2024-10-13 00:46:26,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:46:26,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:46:26,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:46:26,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:46:26,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,392 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-10-13 00:46:26,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:46:26,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:46:26,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:46:26,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:46:26,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,447 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:46:26,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:46:26,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:46:26,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:46:26,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:46:26,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (1/1) ... [2024-10-13 00:46:26,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:46:26,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:46:26,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:46:26,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:46:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:46:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:46:26,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:46:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:46:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:46:26,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:46:26,627 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:46:26,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:46:26,954 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-13 00:46:26,954 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:46:26,975 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:46:26,977 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:46:26,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:26 BoogieIcfgContainer [2024-10-13 00:46:26,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:46:26,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:46:26,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:46:26,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:46:26,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:46:26" (1/3) ... [2024-10-13 00:46:26,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd4b96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:26, skipping insertion in model container [2024-10-13 00:46:26,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:26" (2/3) ... [2024-10-13 00:46:26,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd4b96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:26, skipping insertion in model container [2024-10-13 00:46:26,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:26" (3/3) ... [2024-10-13 00:46:26,985 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2024-10-13 00:46:27,000 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:46:27,000 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:46:27,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:46:27,077 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;@3dba937c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:46:27,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:46:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 00:46:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 00:46:27,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:27,102 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:27,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:27,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash -39417190, now seen corresponding path program 1 times [2024-10-13 00:46:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016904335] [2024-10-13 00:46:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:46:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:46:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:46:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:46:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:46:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:46:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:46:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:46:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:46:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:46:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:46:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:46:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:46:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:46:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:46:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:46:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 00:46:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016904335] [2024-10-13 00:46:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016904335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:46:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:46:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:46:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079289486] [2024-10-13 00:46:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:46:27,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:46:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:27,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:46:27,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:46:27,553 INFO L87 Difference]: Start difference. First operand has 98 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 00:46:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:27,596 INFO L93 Difference]: Finished difference Result 193 states and 339 transitions. [2024-10-13 00:46:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:46:27,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2024-10-13 00:46:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:27,611 INFO L225 Difference]: With dead ends: 193 [2024-10-13 00:46:27,612 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 00:46:27,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:46:27,620 INFO L432 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:27,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:46:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 00:46:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 00:46:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 00:46:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2024-10-13 00:46:27,655 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 183 [2024-10-13 00:46:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:27,655 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2024-10-13 00:46:27,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 00:46:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2024-10-13 00:46:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 00:46:27,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:27,659 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:27,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:46:27,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:27,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash -878507962, now seen corresponding path program 1 times [2024-10-13 00:46:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491419441] [2024-10-13 00:46:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:46:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:46:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:46:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:46:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:46:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:46:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:46:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:46:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:46:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:46:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:46:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:46:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:46:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:46:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:46:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:46:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 00:46:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:28,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491419441] [2024-10-13 00:46:28,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491419441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:46:28,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:46:28,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:46:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371003938] [2024-10-13 00:46:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:46:28,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:46:28,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:28,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:46:28,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:46:28,398 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:46:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:28,799 INFO L93 Difference]: Finished difference Result 412 states and 628 transitions. [2024-10-13 00:46:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:46:28,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-10-13 00:46:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:28,804 INFO L225 Difference]: With dead ends: 412 [2024-10-13 00:46:28,805 INFO L226 Difference]: Without dead ends: 317 [2024-10-13 00:46:28,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:46:28,808 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 318 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:28,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 575 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:46:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-13 00:46:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 201. [2024-10-13 00:46:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 140 states have (on average 1.3642857142857143) internal successors, (191), 140 states have internal predecessors, (191), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 00:46:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 307 transitions. [2024-10-13 00:46:28,847 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 307 transitions. Word has length 184 [2024-10-13 00:46:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:28,848 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 307 transitions. [2024-10-13 00:46:28,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:46:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 307 transitions. [2024-10-13 00:46:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 00:46:28,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:28,852 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:28,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:46:28,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:28,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1422314628, now seen corresponding path program 1 times [2024-10-13 00:46:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656581830] [2024-10-13 00:46:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:46:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:46:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:46:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:46:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:46:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:46:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:46:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:46:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:46:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:46:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:46:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:46:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:46:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:46:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:46:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:46:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 00:46:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656581830] [2024-10-13 00:46:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656581830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:46:29,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:46:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:46:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392708977] [2024-10-13 00:46:29,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:46:29,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:46:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:29,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:46:29,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:46:29,465 INFO L87 Difference]: Start difference. First operand 201 states and 307 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:46:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:29,724 INFO L93 Difference]: Finished difference Result 392 states and 595 transitions. [2024-10-13 00:46:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:46:29,725 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-10-13 00:46:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:29,726 INFO L225 Difference]: With dead ends: 392 [2024-10-13 00:46:29,727 INFO L226 Difference]: Without dead ends: 192 [2024-10-13 00:46:29,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:46:29,731 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 93 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:29,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 401 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:46:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-13 00:46:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2024-10-13 00:46:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 00:46:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 246 transitions. [2024-10-13 00:46:29,770 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 246 transitions. Word has length 184 [2024-10-13 00:46:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:29,772 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 246 transitions. [2024-10-13 00:46:29,772 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:46:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 246 transitions. [2024-10-13 00:46:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-13 00:46:29,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:29,776 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:29,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:46:29,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:29,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1397255605, now seen corresponding path program 1 times [2024-10-13 00:46:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:29,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618724895] [2024-10-13 00:46:29,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:46:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:46:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:46:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:46:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:46:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:46:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:46:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:46:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:46:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:46:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:46:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:46:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:46:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:46:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:46:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:46:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 00:46:30,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618724895] [2024-10-13 00:46:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618724895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:46:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:46:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:46:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759341660] [2024-10-13 00:46:30,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:46:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:46:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:30,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:46:30,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:46:30,123 INFO L87 Difference]: Start difference. First operand 162 states and 246 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:46:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:30,253 INFO L93 Difference]: Finished difference Result 358 states and 546 transitions. [2024-10-13 00:46:30,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:46:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 186 [2024-10-13 00:46:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:30,256 INFO L225 Difference]: With dead ends: 358 [2024-10-13 00:46:30,256 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 00:46:30,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:46:30,258 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 128 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:30,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 592 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:46:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 00:46:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 195. [2024-10-13 00:46:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.2985074626865671) internal successors, (174), 134 states have internal predecessors, (174), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 00:46:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 290 transitions. [2024-10-13 00:46:30,290 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 290 transitions. Word has length 186 [2024-10-13 00:46:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:30,290 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 290 transitions. [2024-10-13 00:46:30,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:46:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 290 transitions. [2024-10-13 00:46:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 00:46:30,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:30,292 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:30,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:46:30,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:30,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash -822916028, now seen corresponding path program 1 times [2024-10-13 00:46:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:30,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602196461] [2024-10-13 00:46:30,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:46:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:46:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:46:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:46:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:46:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:46:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:46:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:46:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:46:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:46:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:46:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:46:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:46:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:46:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:46:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:46:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 120 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2024-10-13 00:46:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602196461] [2024-10-13 00:46:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602196461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:46:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608009828] [2024-10-13 00:46:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:31,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:46:31,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:46:31,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:46:31,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:46:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:31,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 00:46:31,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:46:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 885 proven. 186 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-10-13 00:46:32,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:46:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 129 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2024-10-13 00:46:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608009828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:46:34,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:46:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2024-10-13 00:46:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727167436] [2024-10-13 00:46:34,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:46:34,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-13 00:46:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 00:46:34,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2024-10-13 00:46:34,043 INFO L87 Difference]: Start difference. First operand 195 states and 290 transitions. Second operand has 32 states, 30 states have (on average 4.833333333333333) internal successors, (145), 28 states have internal predecessors, (145), 12 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) [2024-10-13 00:46:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:38,852 INFO L93 Difference]: Finished difference Result 907 states and 1273 transitions. [2024-10-13 00:46:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-10-13 00:46:38,853 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.833333333333333) internal successors, (145), 28 states have internal predecessors, (145), 12 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) Word has length 187 [2024-10-13 00:46:38,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:38,856 INFO L225 Difference]: With dead ends: 907 [2024-10-13 00:46:38,856 INFO L226 Difference]: Without dead ends: 777 [2024-10-13 00:46:38,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4778 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3003, Invalid=10803, Unknown=0, NotChecked=0, Total=13806 [2024-10-13 00:46:38,861 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 775 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 2998 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 2998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:38,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1851 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 2998 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 00:46:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-13 00:46:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 521. [2024-10-13 00:46:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 384 states have (on average 1.2708333333333333) internal successors, (488), 386 states have internal predecessors, (488), 118 states have call successors, (118), 18 states have call predecessors, (118), 18 states have return successors, (118), 116 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-13 00:46:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 724 transitions. [2024-10-13 00:46:38,912 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 724 transitions. Word has length 187 [2024-10-13 00:46:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:38,912 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 724 transitions. [2024-10-13 00:46:38,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.833333333333333) internal successors, (145), 28 states have internal predecessors, (145), 12 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) [2024-10-13 00:46:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 724 transitions. [2024-10-13 00:46:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 00:46:38,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:38,914 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:38,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 00:46:39,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:46:39,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:39,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1625711098, now seen corresponding path program 1 times [2024-10-13 00:46:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:39,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968216095] [2024-10-13 00:46:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:46:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:46:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:46:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:46:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:46:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:46:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:46:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:46:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:46:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:46:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:46:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:46:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:46:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:46:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:46:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:46:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:46:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:46:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:46:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:46:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:46:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:46:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:46:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:46:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:46:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:46:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:46:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:46:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:46:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 00:46:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968216095] [2024-10-13 00:46:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968216095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:46:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864537211] [2024-10-13 00:46:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:39,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:46:39,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:46:39,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:46:39,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 00:46:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:39,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 00:46:39,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:46:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 268 proven. 150 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-10-13 00:46:40,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:46:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 00:46:40,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864537211] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:46:40,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:46:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 19 [2024-10-13 00:46:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033613376] [2024-10-13 00:46:40,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:46:40,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 00:46:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 00:46:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-10-13 00:46:40,843 INFO L87 Difference]: Start difference. First operand 521 states and 724 transitions. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2024-10-13 00:46:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:41,582 INFO L93 Difference]: Finished difference Result 944 states and 1307 transitions. [2024-10-13 00:46:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 00:46:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) Word has length 188 [2024-10-13 00:46:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:41,587 INFO L225 Difference]: With dead ends: 944 [2024-10-13 00:46:41,587 INFO L226 Difference]: Without dead ends: 509 [2024-10-13 00:46:41,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2024-10-13 00:46:41,589 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 301 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:41,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 936 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 00:46:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-13 00:46:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 488. [2024-10-13 00:46:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 351 states have (on average 1.2535612535612535) internal successors, (440), 353 states have internal predecessors, (440), 118 states have call successors, (118), 18 states have call predecessors, (118), 18 states have return successors, (118), 116 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-13 00:46:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 676 transitions. [2024-10-13 00:46:41,662 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 676 transitions. Word has length 188 [2024-10-13 00:46:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:41,663 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 676 transitions. [2024-10-13 00:46:41,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2024-10-13 00:46:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 676 transitions. [2024-10-13 00:46:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 00:46:41,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:41,665 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:41,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 00:46:41,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 00:46:41,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:41,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 558808511, now seen corresponding path program 1 times [2024-10-13 00:46:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995715584] [2024-10-13 00:46:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:46:41,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964252543] [2024-10-13 00:46:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:41,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:46:41,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:46:41,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:46:41,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 00:46:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:46:42,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 00:46:42,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:46:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-13 00:46:42,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:46:42,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:46:42,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995715584] [2024-10-13 00:46:42,881 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 00:46:42,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964252543] [2024-10-13 00:46:42,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964252543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:46:42,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 00:46:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-13 00:46:42,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830242560] [2024-10-13 00:46:42,881 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 00:46:42,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:46:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:46:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:46:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:46:42,883 INFO L87 Difference]: Start difference. First operand 488 states and 676 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 00:46:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:46:43,137 INFO L93 Difference]: Finished difference Result 896 states and 1244 transitions. [2024-10-13 00:46:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:46:43,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 189 [2024-10-13 00:46:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:46:43,140 INFO L225 Difference]: With dead ends: 896 [2024-10-13 00:46:43,141 INFO L226 Difference]: Without dead ends: 500 [2024-10-13 00:46:43,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-10-13 00:46:43,143 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 90 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:46:43,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 488 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:46:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-10-13 00:46:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 490. [2024-10-13 00:46:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 353 states have (on average 1.2521246458923512) internal successors, (442), 355 states have internal predecessors, (442), 118 states have call successors, (118), 18 states have call predecessors, (118), 18 states have return successors, (118), 116 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-13 00:46:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 678 transitions. [2024-10-13 00:46:43,187 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 678 transitions. Word has length 189 [2024-10-13 00:46:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:43,187 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 678 transitions. [2024-10-13 00:46:43,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 00:46:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 678 transitions. [2024-10-13 00:46:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 00:46:43,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:43,189 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:43,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 00:46:43,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:46:43,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:43,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:43,390 INFO L85 PathProgramCache]: Analyzing trace with hash 616066813, now seen corresponding path program 1 times [2024-10-13 00:46:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:43,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993353834] [2024-10-13 00:46:43,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:43,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:46:43,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762931911] [2024-10-13 00:46:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:43,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:46:43,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:46:43,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:46:43,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 00:46:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:46:43,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:46:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:46:43,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:46:43,755 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:46:43,756 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:46:43,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 00:46:43,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:46:43,961 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:44,057 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:46:44,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:46:44 BoogieIcfgContainer [2024-10-13 00:46:44,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:46:44,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:46:44,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:46:44,062 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:46:44,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:26" (3/4) ... [2024-10-13 00:46:44,064 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:46:44,065 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:46:44,066 INFO L158 Benchmark]: Toolchain (without parser) took 18049.91ms. Allocated memory was 165.7MB in the beginning and 419.4MB in the end (delta: 253.8MB). Free memory was 96.5MB in the beginning and 184.4MB in the end (delta: -87.9MB). Peak memory consumption was 166.1MB. Max. memory is 16.1GB. [2024-10-13 00:46:44,066 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 165.7MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:46:44,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.18ms. Allocated memory is still 165.7MB. Free memory was 96.3MB in the beginning and 79.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 00:46:44,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.38ms. Allocated memory is still 165.7MB. Free memory was 79.3MB in the beginning and 135.5MB in the end (delta: -56.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-10-13 00:46:44,066 INFO L158 Benchmark]: Boogie Preprocessor took 87.08ms. Allocated memory is still 165.7MB. Free memory was 135.5MB in the beginning and 128.5MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:46:44,067 INFO L158 Benchmark]: RCFGBuilder took 493.80ms. Allocated memory is still 165.7MB. Free memory was 128.5MB in the beginning and 96.4MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 00:46:44,067 INFO L158 Benchmark]: TraceAbstraction took 17082.34ms. Allocated memory was 165.7MB in the beginning and 419.4MB in the end (delta: 253.8MB). Free memory was 95.6MB in the beginning and 184.4MB in the end (delta: -88.7MB). Peak memory consumption was 165.7MB. Max. memory is 16.1GB. [2024-10-13 00:46:44,067 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 419.4MB. Free memory is still 184.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:46:44,069 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.12ms. Allocated memory is still 165.7MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.18ms. Allocated memory is still 165.7MB. Free memory was 96.3MB in the beginning and 79.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.38ms. Allocated memory is still 165.7MB. Free memory was 79.3MB in the beginning and 135.5MB in the end (delta: -56.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.08ms. Allocated memory is still 165.7MB. Free memory was 135.5MB in the beginning and 128.5MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 493.80ms. Allocated memory is still 165.7MB. Free memory was 128.5MB in the beginning and 96.4MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17082.34ms. Allocated memory was 165.7MB in the beginning and 419.4MB in the end (delta: 253.8MB). Free memory was 95.6MB in the beginning and 184.4MB in the end (delta: -88.7MB). Peak memory consumption was 165.7MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 419.4MB. Free memory is still 184.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of bitwiseOr at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] double var_1_23 = 100.75; [L42] double var_1_24 = 128.8; [L43] signed short int var_1_25 = -4; [L44] signed short int var_1_26 = 256; [L45] unsigned long int var_1_27 = 100000000; [L46] unsigned long int var_1_28 = 5; [L47] unsigned char var_1_29 = 8; [L48] unsigned char var_1_30 = 8; [L49] signed long int var_1_31 = 200; [L50] double var_1_32 = 8.25; [L51] double var_1_33 = 15.5; [L52] unsigned char last_1_var_1_8 = 64; [L53] unsigned char last_1_var_1_19 = 1; [L54] unsigned short int last_1_var_1_20 = 256; [L55] unsigned long int last_1_var_1_22 = 64; [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L159] last_1_var_1_8 = var_1_8 [L160] last_1_var_1_19 = var_1_19 [L161] last_1_var_1_20 = var_1_20 [L162] last_1_var_1_22 = var_1_22 [L172] RET updateLastVariables() [L173] CALL updateVariables() [L111] var_1_3 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L112] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L113] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L113] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L114] var_1_4 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L115] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L116] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L116] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L117] var_1_5 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_6=10, var_1_8=64, var_1_9=5] [L118] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_6=10, var_1_8=64, var_1_9=5] [L119] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L119] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L120] var_1_6 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_8=64, var_1_9=5] [L121] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_8=64, var_1_9=5] [L122] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L122] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L123] var_1_9 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64] [L124] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64] [L125] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L125] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L126] var_1_11 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L127] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L128] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L128] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L129] var_1_13 = __VERIFIER_nondet_float() [L130] 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L130] 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L131] var_1_14 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L132] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L133] var_1_15 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L134] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L135] var_1_17 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L136] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L137] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L137] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L138] var_1_18 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L139] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L140] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L140] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L141] var_1_21 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L142] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L143] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L143] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L144] var_1_24 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L145] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L146] var_1_26 = __VERIFIER_nondet_short() [L147] CALL assume_abort_if_not(var_1_26 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L147] RET assume_abort_if_not(var_1_26 >= -32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L148] CALL assume_abort_if_not(var_1_26 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L148] RET assume_abort_if_not(var_1_26 <= 32766) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L149] var_1_28 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L150] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L151] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L151] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L152] var_1_30 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L153] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L154] CALL assume_abort_if_not(var_1_30 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L154] RET assume_abort_if_not(var_1_30 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L155] var_1_32 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L156] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L173] RET updateVariables() [L174] CALL step() [L59] var_1_23 = var_1_24 [L60] var_1_25 = var_1_26 [L61] var_1_27 = var_1_28 [L62] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L63] COND TRUE (var_1_23 + (- var_1_24)) == var_1_32 [L64] var_1_31 = var_1_26 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=31/2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L66] var_1_33 = var_1_24 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L67] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L68] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L72] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L73] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L78] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=-147458, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L79] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L80] COND TRUE \read(var_1_16) [L81] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L88] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L89] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L95] COND TRUE var_1_12 >= (1.3 / var_1_3) [L96] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L100] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L101] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L102] COND TRUE stepLocal_1 || var_1_16 [L103] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L106] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L106] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L106] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L165-L166] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-147458, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=98303] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1715 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1705 mSDsluCounter, 4987 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3820 mSDsCounter, 1001 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4303 IncrementalHoareTripleChecker+Invalid, 5304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1001 mSolverCounterUnsat, 1167 mSDtfsCounter, 4303 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1642 GetRequests, 1478 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4952 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=5, InterpolantAutomatonStates: 139, 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, 7 MinimizatonAttempts, 501 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2243 NumberOfCodeBlocks, 2243 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2040 ConstructedInterpolants, 0 QuantifiedInterpolants, 13493 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1304 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 17045/17864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:46:44,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:46:46,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:46:46,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:46:46,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:46:46,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:46:46,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:46:46,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:46:46,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:46:46,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:46:46,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:46:46,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:46:46,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:46:46,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:46:46,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:46:46,128 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:46:46,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:46:46,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:46:46,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:46:46,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:46:46,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:46:46,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:46:46,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:46:46,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:46:46,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:46:46,133 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:46:46,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:46:46,133 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:46:46,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:46:46,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:46:46,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:46:46,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:46:46,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:46:46,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:46:46,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:46:46,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:46:46,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:46:46,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:46:46,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:46:46,139 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:46:46,139 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:46:46,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:46:46,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:46:46,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:46:46,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:46:46,141 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:46:46,141 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 [2024-10-13 00:46:46,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:46:46,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:46:46,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:46:46,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:46:46,438 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:46:46,440 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-47.i [2024-10-13 00:46:47,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:46:47,986 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:46:47,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2024-10-13 00:46:47,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34570f61e/0fb76664a10e4635b80c68c3c4a3ad4e/FLAG5ec6626ab [2024-10-13 00:46:48,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34570f61e/0fb76664a10e4635b80c68c3c4a3ad4e [2024-10-13 00:46:48,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:46:48,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:46:48,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:46:48,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:46:48,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:46:48,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69840f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48, skipping insertion in model container [2024-10-13 00:46:48,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:46:48,217 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-47.i[915,928] [2024-10-13 00:46:48,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:46:48,302 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:46:48,315 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-47.i[915,928] [2024-10-13 00:46:48,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:46:48,356 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:46:48,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48 WrapperNode [2024-10-13 00:46:48,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:46:48,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:46:48,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:46:48,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:46:48,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,399 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-10-13 00:46:48,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:46:48,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:46:48,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:46:48,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:46:48,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,433 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:46:48,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:46:48,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:46:48,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:46:48,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:46:48,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (1/1) ... [2024-10-13 00:46:48,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:46:48,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:46:48,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:46:48,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:46:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:46:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:46:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:46:48,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:46:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:46:48,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:46:48,632 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:46:48,634 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:47:01,158 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:47:01,159 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:47:01,213 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:47:01,213 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:47:01,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:47:01 BoogieIcfgContainer [2024-10-13 00:47:01,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:47:01,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:47:01,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:47:01,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:47:01,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:46:48" (1/3) ... [2024-10-13 00:47:01,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632d2cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:47:01, skipping insertion in model container [2024-10-13 00:47:01,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:48" (2/3) ... [2024-10-13 00:47:01,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632d2cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:47:01, skipping insertion in model container [2024-10-13 00:47:01,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:47:01" (3/3) ... [2024-10-13 00:47:01,223 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2024-10-13 00:47:01,238 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:47:01,238 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:47:01,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:47:01,299 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;@7683e064, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:47:01,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:47:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 00:47:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-13 00:47:01,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:01,334 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:47:01,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1218233271, now seen corresponding path program 1 times [2024-10-13 00:47:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:47:01,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555781329] [2024-10-13 00:47:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:01,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:47:01,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:47:01,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:47:01,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:47:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:02,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:47:02,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:47:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-13 00:47:02,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:47:02,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:47:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555781329] [2024-10-13 00:47:02,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555781329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:02,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:47:02,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:47:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141988727] [2024-10-13 00:47:02,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:47:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:47:02,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:47:02,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:47:02,297 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 00:47:06,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:47:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:47:06,549 INFO L93 Difference]: Finished difference Result 147 states and 263 transitions. [2024-10-13 00:47:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:47:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 179 [2024-10-13 00:47:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:47:06,633 INFO L225 Difference]: With dead ends: 147 [2024-10-13 00:47:06,633 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 00:47:06,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:47:06,638 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:47:06,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 00:47:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 00:47:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 00:47:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 00:47:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-13 00:47:06,683 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 179 [2024-10-13 00:47:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:47:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-13 00:47:06,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 00:47:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-13 00:47:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-13 00:47:06,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:06,686 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:47:06,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 00:47:06,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:47:06,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -214454019, now seen corresponding path program 1 times [2024-10-13 00:47:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:47:06,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670189091] [2024-10-13 00:47:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:06,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:47:06,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:47:06,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:47:06,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:47:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:07,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 00:47:07,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:47:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-13 00:47:10,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:47:11,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:47:11,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670189091] [2024-10-13 00:47:11,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670189091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:47:11,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [626126047] [2024-10-13 00:47:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:11,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 00:47:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 00:47:11,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 00:47:11,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 00:47:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:13,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 00:47:13,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:47:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 00:47:16,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:47:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [626126047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:16,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 00:47:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-13 00:47:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030664822] [2024-10-13 00:47:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:16,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:47:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:47:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:47:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:47:16,909 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:47:21,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:47:27,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:47:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:47:27,479 INFO L93 Difference]: Finished difference Result 350 states and 541 transitions. [2024-10-13 00:47:27,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 00:47:27,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 179 [2024-10-13 00:47:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:47:27,485 INFO L225 Difference]: With dead ends: 350 [2024-10-13 00:47:27,485 INFO L226 Difference]: Without dead ends: 278 [2024-10-13 00:47:27,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-13 00:47:27,487 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 265 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 181 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:47:27,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 601 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2024-10-13 00:47:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-13 00:47:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 155. [2024-10-13 00:47:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 00:47:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2024-10-13 00:47:27,532 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 179 [2024-10-13 00:47:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:47:27,533 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2024-10-13 00:47:27,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:47:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2024-10-13 00:47:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-13 00:47:27,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:27,536 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:47:27,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-13 00:47:27,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 00:47:27,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:47:27,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:27,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash -801260033, now seen corresponding path program 1 times [2024-10-13 00:47:27,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:47:27,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886998459] [2024-10-13 00:47:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:47:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:47:27,941 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:47:27,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 00:47:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:28,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 00:47:28,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:47:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 00:47:38,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:47:38,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:47:38,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886998459] [2024-10-13 00:47:38,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886998459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:38,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:47:38,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:47:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586234719] [2024-10-13 00:47:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:47:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:47:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:47:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:47:38,326 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 00:47:42,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:47:47,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:47:51,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:47:55,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []