./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.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 5098132933ca883ef364a77e95c51d3cf42bb9b570e45543a498fd4c246df361 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:03:02,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:03:02,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:03:02,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:03:02,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:03:02,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:03:02,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:03:02,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:03:02,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:03:02,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:03:02,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:03:02,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:03:02,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:03:02,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:03:02,828 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:03:02,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:03:02,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:03:02,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:03:02,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:03:02,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:03:02,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:03:02,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:03:02,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:03:02,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:03:02,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:03:02,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:03:02,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:03:02,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:03:02,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:03:02,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:03:02,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:03:02,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:03:02,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:03:02,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:03:02,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:03:02,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:03:02,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:03:02,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:03:02,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:03:02,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:03:02,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:03:02,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:03:02,841 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 -> 5098132933ca883ef364a77e95c51d3cf42bb9b570e45543a498fd4c246df361 [2024-11-20 04:03:03,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:03:03,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:03:03,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:03:03,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:03:03,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:03:03,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-11-20 04:03:04,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:03:04,835 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:03:04,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-11-20 04:03:04,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9dfd2c4/530d8e8ee1ee45d684c6763a73b4e5fa/FLAG2025fe643 [2024-11-20 04:03:05,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9dfd2c4/530d8e8ee1ee45d684c6763a73b4e5fa [2024-11-20 04:03:05,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:03:05,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:03:05,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:03:05,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:03:05,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:03:05,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aeb2ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05, skipping insertion in model container [2024-11-20 04:03:05,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:03:05,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i[919,932] [2024-11-20 04:03:05,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:03:05,531 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:03:05,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i[919,932] [2024-11-20 04:03:05,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:03:05,621 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:03:05,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05 WrapperNode [2024-11-20 04:03:05,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:03:05,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:03:05,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:03:05,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:03:05,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,710 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-20 04:03:05,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:03:05,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:03:05,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:03:05,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:03:05,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,759 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-20 04:03:05,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:03:05,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:03:05,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:03:05,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:03:05,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (1/1) ... [2024-11-20 04:03:05,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:03:05,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:03:05,848 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-20 04:03:05,851 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-20 04:03:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:03:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:03:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:03:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:03:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:03:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:03:05,972 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:03:05,974 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:03:06,606 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-20 04:03:06,607 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:03:06,624 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:03:06,626 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:03:06,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:03:06 BoogieIcfgContainer [2024-11-20 04:03:06,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:03:06,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:03:06,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:03:06,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:03:06,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:03:05" (1/3) ... [2024-11-20 04:03:06,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd5ca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:03:06, skipping insertion in model container [2024-11-20 04:03:06,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:05" (2/3) ... [2024-11-20 04:03:06,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd5ca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:03:06, skipping insertion in model container [2024-11-20 04:03:06,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:03:06" (3/3) ... [2024-11-20 04:03:06,638 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-11-20 04:03:06,659 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:03:06,659 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:03:06,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:03:06,742 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;@18181646, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:03:06,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:03:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 04:03:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 04:03:06,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:03:06,768 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:03:06,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:03:06,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:03:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1333937396, now seen corresponding path program 1 times [2024-11-20 04:03:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:03:06,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571968718] [2024-11-20 04:03:06,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:06,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:03:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:03:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:03:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:03:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:03:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:03:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:03:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:03:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:03:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:03:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:03:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:03:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:03:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:03:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:03:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:03:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:03:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:03:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:03:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:03:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:03:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:03:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:03:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:03:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 04:03:07,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:03:07,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571968718] [2024-11-20 04:03:07,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571968718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:03:07,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:03:07,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:03:07,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567600351] [2024-11-20 04:03:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:03:07,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:03:07,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:03:07,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:03:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:03:07,395 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 04:03:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:03:07,454 INFO L93 Difference]: Finished difference Result 177 states and 303 transitions. [2024-11-20 04:03:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:03:07,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2024-11-20 04:03:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:03:07,485 INFO L225 Difference]: With dead ends: 177 [2024-11-20 04:03:07,486 INFO L226 Difference]: Without dead ends: 88 [2024-11-20 04:03:07,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-20 04:03:07,499 INFO L432 NwaCegarLoop]: 135 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, 135 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-20 04:03:07,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:03:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-20 04:03:07,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-20 04:03:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 04:03:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2024-11-20 04:03:07,573 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 154 [2024-11-20 04:03:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:03:07,573 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2024-11-20 04:03:07,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 04:03:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2024-11-20 04:03:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 04:03:07,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:03:07,580 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:03:07,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:03:07,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:03:07,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:03:07,582 INFO L85 PathProgramCache]: Analyzing trace with hash 855457527, now seen corresponding path program 1 times [2024-11-20 04:03:07,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:03:07,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785243236] [2024-11-20 04:03:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:07,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:03:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:03:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:03:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:03:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:03:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:03:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:03:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:03:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:03:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:03:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:03:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:03:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:03:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:03:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:03:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:03:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:03:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:03:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:03:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:03:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:03:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:03:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:03:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:03:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 04:03:08,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:03:08,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785243236] [2024-11-20 04:03:08,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785243236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:03:08,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:03:08,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:03:08,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269535257] [2024-11-20 04:03:08,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:03:08,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:03:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:03:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:03:08,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:03:08,333 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 04:03:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:03:08,510 INFO L93 Difference]: Finished difference Result 221 states and 338 transitions. [2024-11-20 04:03:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:03:08,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-20 04:03:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:03:08,517 INFO L225 Difference]: With dead ends: 221 [2024-11-20 04:03:08,517 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 04:03:08,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:03:08,522 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 57 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:03:08,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 391 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:03:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 04:03:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-11-20 04:03:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 04:03:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2024-11-20 04:03:08,555 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 155 [2024-11-20 04:03:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:03:08,556 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2024-11-20 04:03:08,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 04:03:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2024-11-20 04:03:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 04:03:08,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:03:08,562 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:03:08,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:03:08,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:03:08,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:03:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1287781879, now seen corresponding path program 1 times [2024-11-20 04:03:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:03:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955941614] [2024-11-20 04:03:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:03:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:03:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:03:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:03:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:03:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:03:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:03:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:03:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:03:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:03:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:03:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:03:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:03:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:03:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:03:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:03:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:03:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:03:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:03:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:03:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:03:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:03:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:03:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:03:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 04:03:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:03:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955941614] [2024-11-20 04:03:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955941614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:03:27,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:03:27,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 04:03:27,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251200316] [2024-11-20 04:03:27,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:03:27,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:03:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:03:27,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:03:27,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:03:27,531 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 04:03:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:03:31,888 INFO L93 Difference]: Finished difference Result 520 states and 786 transitions. [2024-11-20 04:03:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 04:03:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-20 04:03:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:03:31,899 INFO L225 Difference]: With dead ends: 520 [2024-11-20 04:03:31,900 INFO L226 Difference]: Without dead ends: 390 [2024-11-20 04:03:31,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:03:31,903 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 451 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:03:31,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 411 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-20 04:03:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-20 04:03:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 290. [2024-11-20 04:03:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.497991967871486) internal successors, (373), 252 states have internal predecessors, (373), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 04:03:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 443 transitions. [2024-11-20 04:03:31,947 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 443 transitions. Word has length 155 [2024-11-20 04:03:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:03:31,947 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 443 transitions. [2024-11-20 04:03:31,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 04:03:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 443 transitions. [2024-11-20 04:03:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 04:03:31,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:03:31,951 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:03:31,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:03:31,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:03:31,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:03:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1506636597, now seen corresponding path program 1 times [2024-11-20 04:03:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:03:31,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642366956] [2024-11-20 04:03:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:03:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:03:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:03:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:03:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:03:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:03:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:03:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:03:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:03:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:03:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:03:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:03:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:03:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:03:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:03:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:03:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:03:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:03:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:03:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:03:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:03:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:03:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:03:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:03:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 04:03:32,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:03:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642366956] [2024-11-20 04:03:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642366956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:03:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79372880] [2024-11-20 04:03:32,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:32,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:03:32,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:03:32,436 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-20 04:03:32,438 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-20 04:03:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:32,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 04:03:32,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:03:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 602 proven. 66 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-11-20 04:03:33,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:03:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 60 proven. 69 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-20 04:03:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79372880] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:03:33,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:03:33,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2024-11-20 04:03:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599229057] [2024-11-20 04:03:33,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:03:33,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 04:03:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:03:33,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 04:03:33,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-20 04:03:33,437 INFO L87 Difference]: Start difference. First operand 290 states and 443 transitions. Second operand has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) [2024-11-20 04:03:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:03:34,480 INFO L93 Difference]: Finished difference Result 749 states and 1119 transitions. [2024-11-20 04:03:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-20 04:03:34,481 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) Word has length 155 [2024-11-20 04:03:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:03:34,488 INFO L225 Difference]: With dead ends: 749 [2024-11-20 04:03:34,489 INFO L226 Difference]: Without dead ends: 462 [2024-11-20 04:03:34,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=368, Invalid=892, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 04:03:34,494 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 543 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:03:34,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 431 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 04:03:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-20 04:03:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 302. [2024-11-20 04:03:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 258 states have (on average 1.4573643410852712) internal successors, (376), 261 states have internal predecessors, (376), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 04:03:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 446 transitions. [2024-11-20 04:03:34,544 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 446 transitions. Word has length 155 [2024-11-20 04:03:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:03:34,545 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 446 transitions. [2024-11-20 04:03:34,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.823529411764706) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) [2024-11-20 04:03:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 446 transitions. [2024-11-20 04:03:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 04:03:34,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:03:34,548 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:03:34,561 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-20 04:03:34,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:03:34,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:03:34,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:03:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1899663607, now seen corresponding path program 1 times [2024-11-20 04:03:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:03:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370640429] [2024-11-20 04:03:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:03:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:03:34,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37129170] [2024-11-20 04:03:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:34,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:03:34,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:03:34,861 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:03:34,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:03:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:03:35,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:03:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:03:35,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:03:35,298 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:03:35,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:03:35,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 04:03:35,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:03:35,504 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 04:03:35,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:03:35,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:03:35 BoogieIcfgContainer [2024-11-20 04:03:35,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:03:35,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:03:35,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:03:35,645 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:03:35,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:03:06" (3/4) ... [2024-11-20 04:03:35,647 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:03:35,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:03:35,649 INFO L158 Benchmark]: Toolchain (without parser) took 30454.39ms. Allocated memory was 142.6MB in the beginning and 507.5MB in the end (delta: 364.9MB). Free memory was 70.2MB in the beginning and 459.7MB in the end (delta: -389.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:03:35,649 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:03:35,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.14ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 112.4MB in the end (delta: -42.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-20 04:03:35,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.96ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 112.4MB in the beginning and 159.7MB in the end (delta: -47.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-20 04:03:35,650 INFO L158 Benchmark]: Boogie Preprocessor took 95.52ms. Allocated memory is still 190.8MB. Free memory was 159.7MB in the beginning and 152.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 04:03:35,651 INFO L158 Benchmark]: RCFGBuilder took 816.73ms. Allocated memory is still 190.8MB. Free memory was 152.3MB in the beginning and 118.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-20 04:03:35,651 INFO L158 Benchmark]: TraceAbstraction took 29014.41ms. Allocated memory was 190.8MB in the beginning and 507.5MB in the end (delta: 316.7MB). Free memory was 118.8MB in the beginning and 460.7MB in the end (delta: -341.9MB). Peak memory consumption was 269.1MB. Max. memory is 16.1GB. [2024-11-20 04:03:35,651 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 507.5MB. Free memory was 460.7MB in the beginning and 459.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:03:35,653 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.15ms. Allocated memory is still 142.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.14ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 112.4MB in the end (delta: -42.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.96ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 112.4MB in the beginning and 159.7MB in the end (delta: -47.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.52ms. Allocated memory is still 190.8MB. Free memory was 159.7MB in the beginning and 152.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 816.73ms. Allocated memory is still 190.8MB. Free memory was 152.3MB in the beginning and 118.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 29014.41ms. Allocated memory was 190.8MB in the beginning and 507.5MB in the end (delta: 316.7MB). Free memory was 118.8MB in the beginning and 460.7MB in the end (delta: -341.9MB). Peak memory consumption was 269.1MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 507.5MB. Free memory was 460.7MB in the beginning and 459.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 171. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_11 = 63.75; [L32] signed long int var_1_12 = 100000; [L33] unsigned short int var_1_13 = 8; [L34] signed long int var_1_14 = 2; [L35] signed long int var_1_15 = 32; [L36] double var_1_17 = 127.5; [L37] double var_1_18 = 32.75; [L38] signed char var_1_19 = 0; [L39] unsigned long int var_1_20 = 128; [L40] unsigned long int var_1_21 = 32; [L41] unsigned char var_1_23 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_27 = 16; [L45] signed long int var_1_29 = 5; [L46] unsigned char var_1_31 = 128; [L47] signed char var_1_33 = 50; [L48] unsigned short int last_1_var_1_13 = 8; [L49] double last_1_var_1_17 = 127.5; VAL [isInitial=0, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L175] isInitial = 1 [L176] FCALL initially() [L177] COND TRUE 1 [L178] CALL updateLastVariables() [L167] last_1_var_1_13 = var_1_13 [L168] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L178] RET updateLastVariables() [L179] CALL updateVariables() [L130] var_1_2 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L131] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L133] var_1_3 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L134] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L135] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L135] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L137] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L139] var_1_5 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L140] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L142] var_1_7 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L143] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L144] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L145] var_1_8 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L146] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L147] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L148] var_1_11 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L149] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L150] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L150] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L151] var_1_14 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L153] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L153] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L154] var_1_15 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L156] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L156] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L157] var_1_18 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L158] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L162] var_1_26 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L163] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L164] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L164] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L179] RET updateVariables() [L180] CALL step() [L53] COND FALSE !(-100000 >= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L56] COND FALSE !((last_1_var_1_17 / var_1_11) == 999999.6f) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L60] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L61] COND TRUE var_1_2 && stepLocal_0 [L62] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L66] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L73] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L75] var_1_17 = var_1_18 [L76] var_1_19 = 5 [L77] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L78] COND FALSE !(var_1_1 < var_1_20) [L85] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L87] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L87] EXPR var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L87] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) [L94] var_1_13 = var_1_1 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L96] var_1_21 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L97] COND FALSE !(var_1_15 > var_1_9) [L102] var_1_23 = (! var_1_26) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L104] var_1_27 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L105] COND TRUE var_1_15 != (var_1_4 + var_1_4) [L106] var_1_29 = ((((var_1_4) > (((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) < (var_1_6)) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (var_1_6))))) ? (var_1_4) : (((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) < (var_1_6)) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (var_1_6)))))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L110] COND FALSE !((-25 + (var_1_7 + var_1_1)) <= var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L117] COND TRUE var_1_3 || (var_1_25 && var_1_2) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=50, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L118] COND TRUE var_1_6 >= var_1_14 [L119] var_1_33 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L180] RET step() [L181] CALL, EXPR property() [L171] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L171-L172] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L181] RET, EXPR property() [L181] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=1, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=1, var_1_21=254, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=254, var_1_2=1, var_1_31=128, var_1_33=0, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.8s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1056 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1051 mSDsluCounter, 1368 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 856 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 512 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 520 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=4, InterpolantAutomatonStates: 42, 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, 4 MinimizatonAttempts, 263 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 1084 NumberOfCodeBlocks, 1084 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 923 ConstructedInterpolants, 0 QuantifiedInterpolants, 6364 SizeOfPredicates, 3 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 5883/6072 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-20 04:03:35,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.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 5098132933ca883ef364a77e95c51d3cf42bb9b570e45543a498fd4c246df361 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:03:37,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:03:37,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:03:37,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:03:37,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:03:37,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:03:37,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:03:37,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:03:37,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:03:37,960 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:03:37,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:03:37,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:03:37,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:03:37,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:03:37,966 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:03:37,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:03:37,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:03:37,967 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:03:37,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:03:37,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:03:37,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:03:37,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:03:37,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:03:37,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:03:37,973 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:03:37,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:03:37,973 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:03:37,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:03:37,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:03:37,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:03:37,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:03:37,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:03:37,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:03:37,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:03:37,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:03:37,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:03:37,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:03:37,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:03:37,976 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:03:37,976 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:03:37,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:03:37,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:03:37,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:03:37,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:03:37,979 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 -> 5098132933ca883ef364a77e95c51d3cf42bb9b570e45543a498fd4c246df361 [2024-11-20 04:03:38,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:03:38,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:03:38,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:03:38,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:03:38,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:03:38,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-11-20 04:03:39,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:03:40,179 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:03:40,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-11-20 04:03:40,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9be533bb/e1f015a1aee346f7a936a1ef6edecfee/FLAG94eabc057 [2024-11-20 04:03:40,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9be533bb/e1f015a1aee346f7a936a1ef6edecfee [2024-11-20 04:03:40,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:03:40,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:03:40,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:03:40,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:03:40,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:03:40,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f7cd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40, skipping insertion in model container [2024-11-20 04:03:40,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:03:40,488 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i[919,932] [2024-11-20 04:03:40,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:03:40,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:03:40,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_fillercodestructure_filler-pe-ci_file-46.i[919,932] [2024-11-20 04:03:40,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:03:40,679 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:03:40,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40 WrapperNode [2024-11-20 04:03:40,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:03:40,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:03:40,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:03:40,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:03:40,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,733 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-20 04:03:40,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:03:40,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:03:40,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:03:40,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:03:40,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,785 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-20 04:03:40,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:03:40,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:03:40,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:03:40,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:03:40,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (1/1) ... [2024-11-20 04:03:40,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:03:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:03:40,868 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-20 04:03:40,871 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-20 04:03:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:03:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:03:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:03:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:03:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:03:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:03:41,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:03:41,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:03:54,144 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 04:03:54,146 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:03:54,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:03:54,162 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:03:54,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:03:54 BoogieIcfgContainer [2024-11-20 04:03:54,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:03:54,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:03:54,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:03:54,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:03:54,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:03:40" (1/3) ... [2024-11-20 04:03:54,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167d1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:03:54, skipping insertion in model container [2024-11-20 04:03:54,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:03:40" (2/3) ... [2024-11-20 04:03:54,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167d1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:03:54, skipping insertion in model container [2024-11-20 04:03:54,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:03:54" (3/3) ... [2024-11-20 04:03:54,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-46.i [2024-11-20 04:03:54,202 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:03:54,202 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:03:54,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:03:54,294 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;@2b3a3bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:03:54,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:03:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 04:03:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-20 04:03:54,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:03:54,311 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:03:54,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:03:54,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:03:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1770855076, now seen corresponding path program 1 times [2024-11-20 04:03:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:03:54,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463137911] [2024-11-20 04:03:54,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:54,330 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-20 04:03:54,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:03:54,334 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-20 04:03:54,444 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-20 04:03:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:55,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:03:55,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:03:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-20 04:03:55,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:03:55,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:03:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463137911] [2024-11-20 04:03:55,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463137911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:03:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:03:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:03:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120888507] [2024-11-20 04:03:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:03:55,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:03:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:03:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:03:55,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:03:55,346 INFO L87 Difference]: Start difference. First operand has 75 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 04:03:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:03:55,373 INFO L93 Difference]: Finished difference Result 142 states and 249 transitions. [2024-11-20 04:03:55,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:03:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-11-20 04:03:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:03:55,385 INFO L225 Difference]: With dead ends: 142 [2024-11-20 04:03:55,385 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 04:03:55,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-20 04:03:55,392 INFO L432 NwaCegarLoop]: 106 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, 106 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-20 04:03:55,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:03:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 04:03:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 04:03:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 04:03:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-20 04:03:55,435 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 150 [2024-11-20 04:03:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:03:55,436 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-20 04:03:55,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 04:03:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-20 04:03:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 04:03:55,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:03:55,440 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:03:55,460 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-20 04:03:55,641 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-20 04:03:55,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:03:55,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:03:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash -761104433, now seen corresponding path program 1 times [2024-11-20 04:03:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:03:55,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134634084] [2024-11-20 04:03:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:03:55,644 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-20 04:03:55,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:03:55,646 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-20 04:03:55,647 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-20 04:03:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:03:56,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:03:56,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:03:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 256 proven. 57 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-20 04:03:59,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:04:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 04:04:01,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:04:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134634084] [2024-11-20 04:04:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134634084] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 04:04:01,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 04:04:01,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 04:04:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424287751] [2024-11-20 04:04:01,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:04:01,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:04:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:04:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:04:01,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:04:01,307 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 04:04:05,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:04:09,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:04:13,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:04:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:04:13,856 INFO L93 Difference]: Finished difference Result 167 states and 251 transitions. [2024-11-20 04:04:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:04:13,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-11-20 04:04:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:04:13,859 INFO L225 Difference]: With dead ends: 167 [2024-11-20 04:04:13,859 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 04:04:13,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:04:13,862 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 31 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:04:13,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 304 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2024-11-20 04:04:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 04:04:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-20 04:04:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 04:04:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-11-20 04:04:13,891 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 151 [2024-11-20 04:04:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:04:13,892 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-11-20 04:04:13,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 04:04:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-11-20 04:04:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 04:04:13,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:04:13,896 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:04:13,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:04:14,097 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-20 04:04:14,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:04:14,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:04:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash -997525809, now seen corresponding path program 1 times [2024-11-20 04:04:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:04:14,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666325120] [2024-11-20 04:04:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:04:14,099 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-20 04:04:14,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:04:14,103 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-20 04:04:14,104 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