./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:54:42,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:54:42,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:54:42,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:54:42,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:54:42,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:54:42,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:54:42,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:54:42,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:54:42,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:54:42,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:54:42,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:54:42,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:54:42,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:54:42,984 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:54:42,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:54:42,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:54:42,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:54:42,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:54:42,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:54:42,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:54:42,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:54:42,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:54:42,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:54:42,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:54:42,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:54:42,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:54:42,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:54:42,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:54:42,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:54:42,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:54:42,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:54:42,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:42,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:54:42,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:54:42,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:54:42,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:54:42,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:54:42,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:54:42,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:54:42,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:54:42,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:54:42,997 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 -> 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 [2024-11-08 22:54:43,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:54:43,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:54:43,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:54:43,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:54:43,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:54:43,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i [2024-11-08 22:54:44,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:54:44,923 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:54:44,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i [2024-11-08 22:54:44,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18f36f6a/f7b72a4ae26845ada2efad35d1a0e116/FLAGddb4bef7e [2024-11-08 22:54:44,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c18f36f6a/f7b72a4ae26845ada2efad35d1a0e116 [2024-11-08 22:54:44,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:54:44,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:54:44,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:44,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:54:44,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:54:44,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:44" (1/1) ... [2024-11-08 22:54:44,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1981c4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:44, skipping insertion in model container [2024-11-08 22:54:44,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:44" (1/1) ... [2024-11-08 22:54:44,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:54:45,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i[913,926] [2024-11-08 22:54:45,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:45,251 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:54:45,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i[913,926] [2024-11-08 22:54:45,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:45,307 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:54:45,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45 WrapperNode [2024-11-08 22:54:45,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:45,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:45,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:54:45,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:54:45,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,366 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-11-08 22:54:45,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:45,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:54:45,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:54:45,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:54:45,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,405 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:54:45,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:54:45,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:54:45,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:54:45,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:54:45,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (1/1) ... [2024-11-08 22:54:45,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:45,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:54:45,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:54:45,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:54:45,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:54:45,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:54:45,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:54:45,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:54:45,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:54:45,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:54:45,636 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:54:45,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:54:46,017 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:54:46,018 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:54:46,031 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:54:46,032 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:54:46,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:46 BoogieIcfgContainer [2024-11-08 22:54:46,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:54:46,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:54:46,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:54:46,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:54:46,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:54:44" (1/3) ... [2024-11-08 22:54:46,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17197527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:54:46, skipping insertion in model container [2024-11-08 22:54:46,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:45" (2/3) ... [2024-11-08 22:54:46,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17197527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:54:46, skipping insertion in model container [2024-11-08 22:54:46,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:46" (3/3) ... [2024-11-08 22:54:46,042 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-96.i [2024-11-08 22:54:46,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:54:46,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:54:46,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:54:46,124 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;@29c27db0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:54:46,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:54:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:54:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:54:46,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:46,148 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:46,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:46,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2110557727, now seen corresponding path program 1 times [2024-11-08 22:54:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626151810] [2024-11-08 22:54:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:54:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:54:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:54:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:54:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:54:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:54:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:54:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:54:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:54:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:54:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:54:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:54:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:54:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:54:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:54:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:54:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:54:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:54:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:54:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:54:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:54:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:54:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:54:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:54:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:54:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 22:54:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:54:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:54:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:54:46,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626151810] [2024-11-08 22:54:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626151810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:54:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528106587] [2024-11-08 22:54:46,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:46,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:54:46,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:54:46,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:54:46,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:54:46,696 INFO L87 Difference]: Start difference. First operand has 73 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:54:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:46,728 INFO L93 Difference]: Finished difference Result 136 states and 237 transitions. [2024-11-08 22:54:46,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:54:46,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2024-11-08 22:54:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:46,741 INFO L225 Difference]: With dead ends: 136 [2024-11-08 22:54:46,741 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 22:54:46,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:54:46,748 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:46,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:54:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 22:54:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 22:54:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:54:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-08 22:54:46,806 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 167 [2024-11-08 22:54:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:46,808 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-08 22:54:46,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:54:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-08 22:54:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:54:46,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:46,814 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:46,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:54:46,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:46,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash 296320473, now seen corresponding path program 1 times [2024-11-08 22:54:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065597636] [2024-11-08 22:54:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:54:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:54:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:54:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:54:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:54:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:54:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:54:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:54:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:54:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:54:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:54:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:54:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:54:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:54:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:54:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:54:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:54:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:54:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:54:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:54:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:54:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:54:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:54:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:54:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:54:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 22:54:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:54:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:54:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:54:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065597636] [2024-11-08 22:54:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065597636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:47,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:54:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331306349] [2024-11-08 22:54:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:47,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:54:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:54:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:54:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:54:47,486 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:54:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:47,710 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2024-11-08 22:54:47,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:54:47,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-11-08 22:54:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:47,715 INFO L225 Difference]: With dead ends: 193 [2024-11-08 22:54:47,715 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 22:54:47,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:54:47,718 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:47,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 271 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:54:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 22:54:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2024-11-08 22:54:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:54:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2024-11-08 22:54:47,765 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 167 [2024-11-08 22:54:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2024-11-08 22:54:47,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:54:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2024-11-08 22:54:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:54:47,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:47,771 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:47,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:54:47,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:47,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 554485911, now seen corresponding path program 1 times [2024-11-08 22:54:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241277867] [2024-11-08 22:54:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:54:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:54:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:54:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:54:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:54:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:54:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:54:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:54:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:54:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:54:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:54:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:54:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:54:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:54:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:54:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:54:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:54:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:54:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:54:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:54:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:54:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:54:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:54:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:54:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:54:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 22:54:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:54:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 30 proven. 48 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 22:54:48,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:54:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241277867] [2024-11-08 22:54:48,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241277867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:54:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531920802] [2024-11-08 22:54:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:48,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:54:48,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:54:48,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:54:48,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:54:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:48,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 22:54:48,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:54:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 944 proven. 120 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-08 22:54:49,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:54:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 69 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2024-11-08 22:54:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531920802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:54:50,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:54:50,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 10] total 27 [2024-11-08 22:54:50,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164076200] [2024-11-08 22:54:50,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:54:50,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 22:54:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:54:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 22:54:50,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2024-11-08 22:54:50,211 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) [2024-11-08 22:54:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:53,586 INFO L93 Difference]: Finished difference Result 485 states and 640 transitions. [2024-11-08 22:54:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-08 22:54:53,587 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) Word has length 167 [2024-11-08 22:54:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:53,596 INFO L225 Difference]: With dead ends: 485 [2024-11-08 22:54:53,596 INFO L226 Difference]: Without dead ends: 422 [2024-11-08 22:54:53,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3293 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2307, Invalid=7793, Unknown=0, NotChecked=0, Total=10100 [2024-11-08 22:54:53,602 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 598 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:53,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 721 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 22:54:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-08 22:54:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 384. [2024-11-08 22:54:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 217 states have (on average 1.064516129032258) internal successors, (231), 219 states have internal predecessors, (231), 135 states have call successors, (135), 31 states have call predecessors, (135), 31 states have return successors, (135), 133 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-08 22:54:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 501 transitions. [2024-11-08 22:54:53,690 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 501 transitions. Word has length 167 [2024-11-08 22:54:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:53,691 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 501 transitions. [2024-11-08 22:54:53,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) [2024-11-08 22:54:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 501 transitions. [2024-11-08 22:54:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:54:53,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:53,701 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:53,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:54:53,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:54:53,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:53,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash 556332953, now seen corresponding path program 1 times [2024-11-08 22:54:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037805195] [2024-11-08 22:54:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:54:53,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:54:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:54:54,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:54:54,122 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:54:54,123 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:54:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:54:54,128 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 22:54:54,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:54:54,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:54:54 BoogieIcfgContainer [2024-11-08 22:54:54,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:54:54,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:54:54,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:54:54,257 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:54:54,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:46" (3/4) ... [2024-11-08 22:54:54,260 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:54:54,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:54:54,262 INFO L158 Benchmark]: Toolchain (without parser) took 9312.63ms. Allocated memory was 190.8MB in the beginning and 299.9MB in the end (delta: 109.1MB). Free memory was 136.3MB in the beginning and 224.1MB in the end (delta: -87.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-08 22:54:54,263 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:54:54,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.24ms. Allocated memory is still 190.8MB. Free memory was 135.8MB in the beginning and 120.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 22:54:54,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.60ms. Allocated memory is still 190.8MB. Free memory was 120.1MB in the beginning and 116.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:54:54,264 INFO L158 Benchmark]: Boogie Preprocessor took 57.31ms. Allocated memory is still 190.8MB. Free memory was 116.9MB in the beginning and 111.4MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:54:54,264 INFO L158 Benchmark]: RCFGBuilder took 600.66ms. Allocated memory is still 190.8MB. Free memory was 111.4MB in the beginning and 142.0MB in the end (delta: -30.7MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-08 22:54:54,265 INFO L158 Benchmark]: TraceAbstraction took 8221.94ms. Allocated memory was 190.8MB in the beginning and 299.9MB in the end (delta: 109.1MB). Free memory was 142.0MB in the beginning and 224.1MB in the end (delta: -82.1MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-08 22:54:54,265 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 299.9MB. Free memory is still 224.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:54:54,268 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.17ms. Allocated memory is still 130.0MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.24ms. Allocated memory is still 190.8MB. Free memory was 135.8MB in the beginning and 120.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.60ms. Allocated memory is still 190.8MB. Free memory was 120.1MB in the beginning and 116.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.31ms. Allocated memory is still 190.8MB. Free memory was 116.9MB in the beginning and 111.4MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 600.66ms. Allocated memory is still 190.8MB. Free memory was 111.4MB in the beginning and 142.0MB in the end (delta: -30.7MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8221.94ms. Allocated memory was 190.8MB in the beginning and 299.9MB in the end (delta: 109.1MB). Free memory was 142.0MB in the beginning and 224.1MB in the end (delta: -82.1MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 299.9MB. Free memory is still 224.1MB. 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 135, overapproximation of someBinaryFLOATComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int last_1_var_1_9 = 4; VAL [isInitial=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L132] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L142] RET updateLastVariables() [L143] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L93] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L94] var_1_8 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L95] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L96] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L97] var_1_10 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L100] var_1_12 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L101] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L102] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L102] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L104] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L105] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L105] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L106] var_1_18 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L107] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L108] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L108] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L109] var_1_19 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L110] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L111] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L111] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L112] var_1_20 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L114] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L114] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L115] var_1_21 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L116] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L117] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L117] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L118] var_1_22 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L119] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L120] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L120] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L121] var_1_25 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L122] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L123] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L123] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L124] var_1_28 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L125] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L126] var_1_29 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L127] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L128] var_1_30 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L129] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L143] RET updateVariables() [L144] CALL step() [L48] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L51] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L52] COND TRUE \read(var_1_4) [L53] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L57] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L58] COND FALSE !(var_1_23 < var_1_23) [L69] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L71] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L72] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L79] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L81] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L84] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 4, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 662 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 650 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 779 mSDsCounter, 754 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 754 mSolverCounterUnsat, 310 mSDtfsCounter, 1222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3293 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=3, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 53 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 830 ConstructedInterpolants, 0 QuantifiedInterpolants, 3359 SizeOfPredicates, 6 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6783/7020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 22:54:54,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:54:56,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:54:56,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:54:56,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:54:56,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:54:56,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:54:56,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:54:56,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:54:56,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:54:56,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:54:56,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:54:56,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:54:56,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:54:56,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:54:56,577 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:54:56,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:54:56,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:54:56,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:54:56,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:54:56,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:54:56,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:54:56,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:54:56,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:54:56,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:54:56,584 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:54:56,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:54:56,584 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:54:56,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:54:56,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:54:56,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:54:56,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:54:56,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:54:56,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:54:56,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:54:56,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:56,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:54:56,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:54:56,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:54:56,588 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:54:56,588 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:54:56,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:54:56,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:54:56,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:54:56,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:54:56,590 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 -> 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 [2024-11-08 22:54:56,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:54:56,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:54:56,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:54:56,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:54:56,950 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:54:56,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i [2024-11-08 22:54:58,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:54:58,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:54:58,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i [2024-11-08 22:54:58,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35478f3bc/abd1f4fb443046d6b81f78bf014c7fde/FLAGcd0d91d2e [2024-11-08 22:54:58,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35478f3bc/abd1f4fb443046d6b81f78bf014c7fde [2024-11-08 22:54:58,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:54:58,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:54:58,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:58,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:54:58,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:54:58,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:58" (1/1) ... [2024-11-08 22:54:58,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f9bada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:58, skipping insertion in model container [2024-11-08 22:54:58,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:58" (1/1) ... [2024-11-08 22:54:58,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:54:58,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i[913,926] [2024-11-08 22:54:59,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:59,023 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:54:59,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-96.i[913,926] [2024-11-08 22:54:59,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:59,098 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:54:59,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59 WrapperNode [2024-11-08 22:54:59,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:59,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:59,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:54:59,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:54:59,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,156 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-08 22:54:59,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:59,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:54:59,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:54:59,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:54:59,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,210 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:54:59,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:54:59,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:54:59,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:54:59,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:54:59,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (1/1) ... [2024-11-08 22:54:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:59,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:54:59,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:54:59,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:54:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:54:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:54:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:54:59,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:54:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:54:59,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:54:59,433 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:54:59,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:55:01,844 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:55:01,845 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:55:01,859 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:55:01,860 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:55:01,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:55:01 BoogieIcfgContainer [2024-11-08 22:55:01,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:55:01,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:55:01,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:55:01,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:55:01,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:54:58" (1/3) ... [2024-11-08 22:55:01,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@868e77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:55:01, skipping insertion in model container [2024-11-08 22:55:01,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:59" (2/3) ... [2024-11-08 22:55:01,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@868e77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:55:01, skipping insertion in model container [2024-11-08 22:55:01,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:55:01" (3/3) ... [2024-11-08 22:55:01,868 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-96.i [2024-11-08 22:55:01,887 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:55:01,888 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:55:01,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:55:01,956 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;@72df602f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:55:01,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:55:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:55:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:55:01,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:55:01,971 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:55:01,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:55:01,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:55:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2110557727, now seen corresponding path program 1 times [2024-11-08 22:55:01,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:55:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297562732] [2024-11-08 22:55:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:55:01,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:55:01,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:55:01,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:55:01,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:55:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:02,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:55:02,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:55:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-08 22:55:02,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:55:02,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:55:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297562732] [2024-11-08 22:55:02,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297562732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:55:02,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:55:02,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:55:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033898767] [2024-11-08 22:55:02,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:55:02,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:55:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:55:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:55:02,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:55:02,438 INFO L87 Difference]: Start difference. First operand has 73 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:55:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:55:02,468 INFO L93 Difference]: Finished difference Result 136 states and 237 transitions. [2024-11-08 22:55:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:55:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2024-11-08 22:55:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:55:02,479 INFO L225 Difference]: With dead ends: 136 [2024-11-08 22:55:02,480 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 22:55:02,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:55:02,488 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:55:02,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:55:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 22:55:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 22:55:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:55:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-08 22:55:02,529 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 167 [2024-11-08 22:55:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:55:02,530 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-08 22:55:02,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:55:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-08 22:55:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:55:02,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:55:02,533 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:55:02,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:55:02,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:55:02,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:55:02,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:55:02,736 INFO L85 PathProgramCache]: Analyzing trace with hash 296320473, now seen corresponding path program 1 times [2024-11-08 22:55:02,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:55:02,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422249352] [2024-11-08 22:55:02,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:55:02,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:55:02,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:55:02,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:55:02,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:55:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:03,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:55:03,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:55:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:55:03,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:55:03,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:55:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422249352] [2024-11-08 22:55:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422249352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:55:03,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:55:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:55:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472904686] [2024-11-08 22:55:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:55:03,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:55:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:55:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:55:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:55:03,875 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:55:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:55:06,713 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2024-11-08 22:55:06,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:55:06,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-11-08 22:55:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:55:06,737 INFO L225 Difference]: With dead ends: 193 [2024-11-08 22:55:06,737 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 22:55:06,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:55:06,741 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 22:55:06,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 271 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 22:55:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 22:55:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2024-11-08 22:55:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:55:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2024-11-08 22:55:06,781 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 167 [2024-11-08 22:55:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:55:06,782 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2024-11-08 22:55:06,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:55:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2024-11-08 22:55:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:55:06,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:55:06,785 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:55:06,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 22:55:06,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:55:06,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:55:06,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:55:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash 554485911, now seen corresponding path program 1 times [2024-11-08 22:55:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:55:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466104328] [2024-11-08 22:55:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:55:06,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:55:06,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:55:06,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:55:06,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 22:55:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:07,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 22:55:07,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:55:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 928 proven. 108 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-08 22:55:08,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:55:08,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:55:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466104328] [2024-11-08 22:55:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466104328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:55:08,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1243707608] [2024-11-08 22:55:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:55:08,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 22:55:08,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 22:55:08,793 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 22:55:08,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-08 22:55:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:09,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:55:09,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:55:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 686 proven. 48 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2024-11-08 22:55:09,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:55:10,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1243707608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:55:10,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:55:10,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 13 [2024-11-08 22:55:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563752743] [2024-11-08 22:55:10,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:55:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 22:55:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:55:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 22:55:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-08 22:55:10,212 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-08 22:55:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:55:13,689 INFO L93 Difference]: Finished difference Result 289 states and 398 transitions. [2024-11-08 22:55:13,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 22:55:13,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 167 [2024-11-08 22:55:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:55:13,695 INFO L225 Difference]: With dead ends: 289 [2024-11-08 22:55:13,695 INFO L226 Difference]: Without dead ends: 226 [2024-11-08 22:55:13,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 22:55:13,697 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 146 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 22:55:13,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 385 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 22:55:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-08 22:55:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 207. [2024-11-08 22:55:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 112 states have (on average 1.0625) internal successors, (119), 113 states have internal predecessors, (119), 81 states have call successors, (81), 13 states have call predecessors, (81), 13 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-08 22:55:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2024-11-08 22:55:13,749 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 167 [2024-11-08 22:55:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:55:13,750 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2024-11-08 22:55:13,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-08 22:55:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2024-11-08 22:55:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:55:13,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:55:13,753 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:55:13,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 22:55:13,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-08 22:55:14,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 22:55:14,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:55:14,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:55:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash 556332953, now seen corresponding path program 1 times [2024-11-08 22:55:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:55:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95590132] [2024-11-08 22:55:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:55:14,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:55:14,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:55:14,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:55:14,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 22:55:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:55:14,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 22:55:14,424 INFO L278 TraceCheckSpWp]: Computing forward predicates...