./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.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_fillercodesize_ps-cn-25_file-54.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 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:41:15,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:41:15,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:41:15,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:41:15,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:41:15,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:41:15,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:41:15,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:41:15,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:41:15,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:41:15,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:41:15,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:41:15,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:41:15,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:41:15,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:41:15,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:41:15,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:41:15,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:41:15,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:41:15,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:41:15,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:41:15,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:41:15,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:41:15,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:41:15,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:41:15,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:41:15,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:41:15,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:41:15,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:41:15,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:41:15,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:41:15,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:41:15,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:41:15,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:41:15,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:41:15,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:41:15,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:41:15,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:41:15,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:41:15,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:41:15,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:41:15,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:41:15,587 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 -> 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 [2024-11-08 20:41:15,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:41:15,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:41:15,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:41:15,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:41:15,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:41:15,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-11-08 20:41:17,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:41:17,319 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:41:17,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-11-08 20:41:17,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b01d929/38a40983d38745b9a85a1b209c4c046b/FLAGfb4fdecb7 [2024-11-08 20:41:17,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b01d929/38a40983d38745b9a85a1b209c4c046b [2024-11-08 20:41:17,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:41:17,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:41:17,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:41:17,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:41:17,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:41:17,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f063c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17, skipping insertion in model container [2024-11-08 20:41:17,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:41:17,528 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_fillercodesize_ps-cn-25_file-54.i[915,928] [2024-11-08 20:41:17,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:41:17,580 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:41:17,610 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_fillercodesize_ps-cn-25_file-54.i[915,928] [2024-11-08 20:41:17,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:41:17,695 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:41:17,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17 WrapperNode [2024-11-08 20:41:17,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:41:17,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:41:17,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:41:17,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:41:17,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,749 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-11-08 20:41:17,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:41:17,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:41:17,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:41:17,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:41:17,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,777 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 20:41:17,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:41:17,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:41:17,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:41:17,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:41:17,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (1/1) ... [2024-11-08 20:41:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:41:17,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:41:17,833 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 20:41:17,835 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 20:41:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:41:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:41:17,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:41:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:41:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:41:17,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:41:17,955 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:41:17,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:41:18,227 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 20:41:18,231 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:41:18,248 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:41:18,248 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:41:18,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:18 BoogieIcfgContainer [2024-11-08 20:41:18,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:41:18,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:41:18,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:41:18,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:41:18,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:41:17" (1/3) ... [2024-11-08 20:41:18,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a36a0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:41:18, skipping insertion in model container [2024-11-08 20:41:18,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:17" (2/3) ... [2024-11-08 20:41:18,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a36a0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:41:18, skipping insertion in model container [2024-11-08 20:41:18,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:18" (3/3) ... [2024-11-08 20:41:18,256 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-11-08 20:41:18,271 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:41:18,272 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:41:18,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:41:18,319 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;@1a31556e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:41:18,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:41:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 20:41:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 20:41:18,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:18,339 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:18,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash 748527241, now seen corresponding path program 1 times [2024-11-08 20:41:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971594478] [2024-11-08 20:41:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:41:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:41:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:41:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:41:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:41:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:41:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:41:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:41:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:41:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:41:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:41:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:41:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:41:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:41:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 20:41:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 20:41:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 20:41:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 20:41:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 20:41:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 20:41:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971594478] [2024-11-08 20:41:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971594478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:18,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:41:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721936093] [2024-11-08 20:41:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:41:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:18,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:41:18,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:41:18,814 INFO L87 Difference]: Start difference. First operand has 82 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 20:41:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:18,839 INFO L93 Difference]: Finished difference Result 157 states and 274 transitions. [2024-11-08 20:41:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:41:18,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-11-08 20:41:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:18,848 INFO L225 Difference]: With dead ends: 157 [2024-11-08 20:41:18,848 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 20:41:18,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 20:41:18,853 INFO L432 NwaCegarLoop]: 120 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, 120 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 20:41:18,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:41:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 20:41:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 20:41:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 20:41:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-11-08 20:41:18,972 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 168 [2024-11-08 20:41:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:18,972 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-11-08 20:41:18,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 20:41:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-11-08 20:41:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 20:41:18,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:18,979 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:18,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:41:18,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:18,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash 961279117, now seen corresponding path program 1 times [2024-11-08 20:41:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:18,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861963474] [2024-11-08 20:41:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:41:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:41:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:41:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:41:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:41:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:41:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:41:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:41:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:41:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:41:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:41:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:41:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:41:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:41:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:41:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:41:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:41:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:41:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:41:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:41:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:41:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 20:41:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 20:41:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 20:41:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-08 20:41:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 20:41:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 20:41:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:41:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861963474] [2024-11-08 20:41:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861963474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:19,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:19,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:41:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938781523] [2024-11-08 20:41:19,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:19,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:41:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:41:19,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:41:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:41:19,590 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:41:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:19,777 INFO L93 Difference]: Finished difference Result 229 states and 355 transitions. [2024-11-08 20:41:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:41:19,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-08 20:41:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:19,780 INFO L225 Difference]: With dead ends: 229 [2024-11-08 20:41:19,780 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 20:41:19,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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 20:41:19,782 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 94 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:19,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 343 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:41:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 20:41:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2024-11-08 20:41:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 20:41:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 214 transitions. [2024-11-08 20:41:19,829 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 214 transitions. Word has length 168 [2024-11-08 20:41:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:19,830 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 214 transitions. [2024-11-08 20:41:19,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:41:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 214 transitions. [2024-11-08 20:41:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 20:41:19,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:19,835 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:19,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:41:19,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:19,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash -868009656, now seen corresponding path program 1 times [2024-11-08 20:41:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:41:19,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753469582] [2024-11-08 20:41:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:19,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:41:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:41:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913618755] [2024-11-08 20:41:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:20,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:41:20,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:41:20,120 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 20:41:20,125 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 20:41:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:41:20,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:41:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:41:20,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:41:20,596 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:41:20,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:41:20,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:41:20,799 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 20:41:20,803 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 20:41:20,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:41:20,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:41:20 BoogieIcfgContainer [2024-11-08 20:41:20,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:41:20,918 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:41:20,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:41:20,918 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:41:20,919 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:18" (3/4) ... [2024-11-08 20:41:20,921 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:41:20,921 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:41:20,922 INFO L158 Benchmark]: Toolchain (without parser) took 3575.09ms. Allocated memory was 174.1MB in the beginning and 249.6MB in the end (delta: 75.5MB). Free memory was 100.7MB in the beginning and 127.6MB in the end (delta: -26.9MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-11-08 20:41:20,922 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:41:20,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.70ms. Allocated memory is still 174.1MB. Free memory was 100.5MB in the beginning and 143.5MB in the end (delta: -42.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-08 20:41:20,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.08ms. Allocated memory is still 174.1MB. Free memory was 143.5MB in the beginning and 140.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:41:20,923 INFO L158 Benchmark]: Boogie Preprocessor took 50.84ms. Allocated memory is still 174.1MB. Free memory was 140.3MB in the beginning and 137.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:41:20,924 INFO L158 Benchmark]: RCFGBuilder took 446.65ms. Allocated memory is still 174.1MB. Free memory was 137.2MB in the beginning and 114.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 20:41:20,925 INFO L158 Benchmark]: TraceAbstraction took 2667.84ms. Allocated memory was 174.1MB in the beginning and 249.6MB in the end (delta: 75.5MB). Free memory was 113.0MB in the beginning and 127.6MB in the end (delta: -14.6MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-08 20:41:20,925 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 249.6MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:41:20,926 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.11ms. Allocated memory is still 174.1MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.70ms. Allocated memory is still 174.1MB. Free memory was 100.5MB in the beginning and 143.5MB in the end (delta: -42.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.08ms. Allocated memory is still 174.1MB. Free memory was 143.5MB in the beginning and 140.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.84ms. Allocated memory is still 174.1MB. Free memory was 140.3MB in the beginning and 137.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.65ms. Allocated memory is still 174.1MB. Free memory was 137.2MB in the beginning and 114.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2667.84ms. Allocated memory was 174.1MB in the beginning and 249.6MB in the end (delta: 75.5MB). Free memory was 113.0MB in the beginning and 127.6MB in the end (delta: -14.6MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 249.6MB. Free memory is still 127.6MB. 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 161, overapproximation of someBinaryFLOATComparisonOperation at line 161. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] float var_1_23 = 4.8; [L42] float var_1_24 = 16.5; [L43] signed long int var_1_25 = 10; [L44] unsigned char var_1_26 = 64; [L45] unsigned short int var_1_27 = 16; [L46] unsigned char var_1_28 = 1; [L47] unsigned char var_1_29 = 0; [L48] signed long int var_1_30 = 2; [L49] signed long int var_1_31 = 10; [L50] unsigned char last_1_var_1_9 = 1; VAL [isInitial=0, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L158] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L168] RET updateLastVariables() [L169] CALL updateVariables() [L114] var_1_4 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L115] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L116] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L117] var_1_5 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L118] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L119] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L120] var_1_8 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L122] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L123] var_1_10 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L124] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L125] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L126] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L127] var_1_11 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L129] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L130] var_1_12 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L131] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L134] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L135] var_1_16 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L136] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L137] var_1_17 = __VERIFIER_nondet_ulong() [L138] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L138] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L139] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L140] var_1_19 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L141] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L142] var_1_20 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L143] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L144] var_1_21 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L145] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L146] var_1_22 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L147] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L148] var_1_24 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L150] var_1_29 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L151] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L153] var_1_31 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_31 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L154] RET assume_abort_if_not(var_1_31 >= -2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L169] RET updateVariables() [L170] CALL step() [L54] var_1_23 = var_1_24 [L55] var_1_25 = 256 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L56] COND TRUE var_1_24 > ((((63.125f) > (var_1_23)) ? (63.125f) : (var_1_23))) [L57] var_1_26 = ((((1) < 0 ) ? -(1) : (1))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L59] var_1_27 = var_1_26 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L60] COND FALSE !(1 > var_1_27) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L65] COND FALSE !(var_1_23 < var_1_24) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L70] COND TRUE \read(var_1_29) [L71] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L76] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=1, var_1_9=1] [L77] COND TRUE var_1_5 == var_1_4 [L78] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=1] [L85] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L92] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=1] [L94] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L95] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=1] [L97] unsigned long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_9=1, stepLocal_0=-9, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=1] [L98] COND TRUE ((var_1_8 % var_1_10) * (8 + var_1_14)) >= stepLocal_0 [L99] var_1_9 = ((! var_1_11) || var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] COND TRUE var_1_18 > var_1_18 [L104] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] unsigned long int stepLocal_1 = (((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=1, stepLocal_1=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] COND FALSE !(((var_1_8 * var_1_1) + var_1_4) >= stepLocal_1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L170] RET step() [L171] CALL, EXPR property() [L161-L162] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-9, var_1_17=-7, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 463 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 237 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 674 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2600/2600 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 20:41:20,954 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_fillercodesize_ps-cn-25_file-54.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 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:41:23,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:41:23,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:41:23,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:41:23,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:41:23,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:41:23,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:41:23,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:41:23,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:41:23,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:41:23,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:41:23,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:41:23,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:41:23,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:41:23,105 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:41:23,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:41:23,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:41:23,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:41:23,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:41:23,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:41:23,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:41:23,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:41:23,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:41:23,110 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:41:23,110 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:41:23,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:41:23,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:41:23,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:41:23,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:41:23,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:41:23,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:41:23,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:41:23,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:41:23,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:41:23,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:41:23,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:41:23,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:41:23,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:41:23,112 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:41:23,112 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:41:23,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:41:23,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:41:23,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:41:23,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:41:23,116 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 -> 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 [2024-11-08 20:41:23,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:41:23,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:41:23,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:41:23,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:41:23,443 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:41:23,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-11-08 20:41:24,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:41:25,112 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:41:25,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-11-08 20:41:25,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460b74b9c/d0b0b169a3ec445293d6221bb8efedce/FLAG536993ed4 [2024-11-08 20:41:25,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460b74b9c/d0b0b169a3ec445293d6221bb8efedce [2024-11-08 20:41:25,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:41:25,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:41:25,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:41:25,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:41:25,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:41:25,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc75ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25, skipping insertion in model container [2024-11-08 20:41:25,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:41:25,317 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_fillercodesize_ps-cn-25_file-54.i[915,928] [2024-11-08 20:41:25,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:41:25,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:41:25,413 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_fillercodesize_ps-cn-25_file-54.i[915,928] [2024-11-08 20:41:25,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:41:25,476 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:41:25,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25 WrapperNode [2024-11-08 20:41:25,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:41:25,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:41:25,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:41:25,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:41:25,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,534 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-08 20:41:25,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:41:25,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:41:25,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:41:25,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:41:25,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,569 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 20:41:25,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:41:25,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:41:25,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:41:25,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:41:25,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (1/1) ... [2024-11-08 20:41:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:41:25,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:41:25,635 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 20:41:25,637 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 20:41:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:41:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:41:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:41:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:41:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:41:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:41:25,747 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:41:25,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:41:29,012 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 20:41:29,013 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:41:29,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:41:29,024 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:41:29,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:29 BoogieIcfgContainer [2024-11-08 20:41:29,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:41:29,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:41:29,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:41:29,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:41:29,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:41:25" (1/3) ... [2024-11-08 20:41:29,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dfa735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:41:29, skipping insertion in model container [2024-11-08 20:41:29,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:41:25" (2/3) ... [2024-11-08 20:41:29,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dfa735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:41:29, skipping insertion in model container [2024-11-08 20:41:29,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:29" (3/3) ... [2024-11-08 20:41:29,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2024-11-08 20:41:29,049 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:41:29,050 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:41:29,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:41:29,105 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;@637b937a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:41:29,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:41:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 20:41:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 20:41:29,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:29,124 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:29,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash 220927109, now seen corresponding path program 1 times [2024-11-08 20:41:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:29,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075118083] [2024-11-08 20:41:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:29,140 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 20:41:29,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:29,143 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 20:41:29,154 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 20:41:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:29,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:41:29,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-08 20:41:29,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:41:29,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:41:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075118083] [2024-11-08 20:41:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075118083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:29,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:41:29,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988918363] [2024-11-08 20:41:29,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:29,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:41:29,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:41:29,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:41:29,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:41:29,623 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 20:41:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:29,676 INFO L93 Difference]: Finished difference Result 149 states and 260 transitions. [2024-11-08 20:41:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:41:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-11-08 20:41:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:29,685 INFO L225 Difference]: With dead ends: 149 [2024-11-08 20:41:29,685 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 20:41:29,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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 20:41:29,691 INFO L432 NwaCegarLoop]: 112 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, 112 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 20:41:29,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:41:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 20:41:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 20:41:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 20:41:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-11-08 20:41:29,727 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 168 [2024-11-08 20:41:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:29,727 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-11-08 20:41:29,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 20:41:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-11-08 20:41:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 20:41:29,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:29,730 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:29,744 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 20:41:29,934 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 20:41:29,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:29,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2086280949, now seen corresponding path program 1 times [2024-11-08 20:41:29,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066123381] [2024-11-08 20:41:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:29,936 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 20:41:29,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:29,938 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 20:41:29,946 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 20:41:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:30,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:41:30,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 20:41:30,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:41:30,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:41:30,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066123381] [2024-11-08 20:41:30,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066123381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:30,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:30,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:41:30,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135642784] [2024-11-08 20:41:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:30,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:41:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:41:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:41:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:30,336 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:41:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:30,389 INFO L93 Difference]: Finished difference Result 184 states and 279 transitions. [2024-11-08 20:41:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:41:30,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-08 20:41:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:30,392 INFO L225 Difference]: With dead ends: 184 [2024-11-08 20:41:30,394 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 20:41:30,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:30,397 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 89 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:30,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 238 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:41:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 20:41:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-08 20:41:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 63 states have internal predecessors, (73), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 20:41:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-11-08 20:41:30,434 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 168 [2024-11-08 20:41:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:30,435 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-11-08 20:41:30,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:41:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2024-11-08 20:41:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 20:41:30,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:30,438 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:30,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 20:41:30,639 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 20:41:30,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:30,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1476387315, now seen corresponding path program 1 times [2024-11-08 20:41:30,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:30,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120566152] [2024-11-08 20:41:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:30,642 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 20:41:30,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:30,644 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 20:41:30,645 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 20:41:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:30,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 20:41:30,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 20:41:31,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:41:31,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:41:31,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120566152] [2024-11-08 20:41:31,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120566152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:31,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:31,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:41:31,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352993221] [2024-11-08 20:41:31,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:31,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:41:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:41:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:41:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:41:31,567 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:41:35,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:41:37,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:41:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:37,766 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2024-11-08 20:41:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:41:37,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-08 20:41:37,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:37,795 INFO L225 Difference]: With dead ends: 222 [2024-11-08 20:41:37,796 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 20:41:37,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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 20:41:37,797 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 68 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:37,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 307 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-08 20:41:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 20:41:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2024-11-08 20:41:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 20:41:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2024-11-08 20:41:37,827 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 168 [2024-11-08 20:41:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:37,827 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2024-11-08 20:41:37,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 20:41:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2024-11-08 20:41:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 20:41:37,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:37,830 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:37,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 20:41:38,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:38,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:38,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -781459785, now seen corresponding path program 1 times [2024-11-08 20:41:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657050195] [2024-11-08 20:41:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:38,040 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 20:41:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:38,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:41:38,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 20:41:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:38,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 20:41:38,446 INFO L278 TraceCheckSpWp]: Computing forward predicates...