./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.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 2f939a31bde08313e00f5c944adf142fba63d3542c78032e0ba52b2cc30f6848 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:39:38,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:39:39,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:39:39,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:39:39,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:39:39,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:39:39,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:39:39,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:39:39,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:39:39,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:39:39,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:39:39,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:39:39,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:39:39,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:39:39,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:39:39,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:39:39,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:39:39,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:39:39,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:39:39,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:39:39,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:39:39,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:39:39,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:39:39,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:39:39,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:39:39,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:39:39,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:39:39,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:39:39,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:39:39,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:39:39,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:39:39,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:39:39,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:39,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:39:39,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:39:39,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:39:39,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:39:39,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:39:39,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:39:39,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:39:39,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:39:39,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:39:39,099 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 -> 2f939a31bde08313e00f5c944adf142fba63d3542c78032e0ba52b2cc30f6848 [2024-11-10 03:39:39,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:39:39,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:39:39,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:39:39,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:39:39,444 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:39:39,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i [2024-11-10 03:39:41,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:39:41,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:39:41,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i [2024-11-10 03:39:41,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cb3f4fc/897c3eab240543679d29ce1b84e3f06b/FLAG0f15236e3 [2024-11-10 03:39:41,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08cb3f4fc/897c3eab240543679d29ce1b84e3f06b [2024-11-10 03:39:41,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:39:41,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:39:41,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:41,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:39:41,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:39:41,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:41" (1/1) ... [2024-11-10 03:39:41,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3b160e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:41, skipping insertion in model container [2024-11-10 03:39:41,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:41" (1/1) ... [2024-11-10 03:39:41,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:39:41,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i[913,926] [2024-11-10 03:39:41,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:41,946 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:39:41,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i[913,926] [2024-11-10 03:39:42,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:42,036 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:39:42,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42 WrapperNode [2024-11-10 03:39:42,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:42,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:42,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:39:42,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:39:42,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,102 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-10 03:39:42,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:42,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:39:42,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:39:42,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:39:42,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,140 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-10 03:39:42,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:39:42,169 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:39:42,169 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:39:42,169 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:39:42,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (1/1) ... [2024-11-10 03:39:42,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:39:42,220 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-10 03:39:42,227 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-10 03:39:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:39:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:39:42,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:39:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:39:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:39:42,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:39:42,350 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:39:42,353 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:39:42,783 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 03:39:42,784 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:39:42,800 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:39:42,800 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:39:42,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:42 BoogieIcfgContainer [2024-11-10 03:39:42,801 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:39:42,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:39:42,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:39:42,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:39:42,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:39:41" (1/3) ... [2024-11-10 03:39:42,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2446de82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:39:42, skipping insertion in model container [2024-11-10 03:39:42,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:42" (2/3) ... [2024-11-10 03:39:42,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2446de82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:39:42, skipping insertion in model container [2024-11-10 03:39:42,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:42" (3/3) ... [2024-11-10 03:39:42,811 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-12.i [2024-11-10 03:39:42,828 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:39:42,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:39:42,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:39:42,900 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;@7045161, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:39:42,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:39:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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-10 03:39:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 03:39:42,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:42,927 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] [2024-11-10 03:39:42,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1163729006, now seen corresponding path program 1 times [2024-11-10 03:39:42,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540761976] [2024-11-10 03:39:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:39:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:39:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:39:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:39:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:39:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:39:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:39:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:39:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:39:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:39:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:39:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:39:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:39:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:39:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:43,542 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-10 03:39:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540761976] [2024-11-10 03:39:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540761976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:43,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:39:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830380110] [2024-11-10 03:39:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:43,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:39:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:39:43,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:39:43,584 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-10 03:39:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:43,620 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2024-11-10 03:39:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:39:43,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (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 147 [2024-11-10 03:39:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:43,633 INFO L225 Difference]: With dead ends: 130 [2024-11-10 03:39:43,634 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 03:39:43,640 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-10 03:39:43,644 INFO L432 NwaCegarLoop]: 95 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, 95 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-10 03:39:43,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:39:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 03:39:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 03:39:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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-10 03:39:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-10 03:39:43,688 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 147 [2024-11-10 03:39:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:43,688 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-10 03:39:43,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (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-10 03:39:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-10 03:39:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 03:39:43,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:43,696 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] [2024-11-10 03:39:43,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:39:43,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash 944211919, now seen corresponding path program 1 times [2024-11-10 03:39:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:43,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014915703] [2024-11-10 03:39:43,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:39:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:39:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:39:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:39:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:39:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:39:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:39:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:39:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:39:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:39:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:39:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:39:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:39:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:39:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:44,942 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-10 03:39:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:44,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014915703] [2024-11-10 03:39:44,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014915703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:44,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:44,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:39:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505488245] [2024-11-10 03:39:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:44,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:39:44,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:44,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:39:44,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:39:44,950 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-10 03:39:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:45,324 INFO L93 Difference]: Finished difference Result 188 states and 281 transitions. [2024-11-10 03:39:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:39:45,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 147 [2024-11-10 03:39:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:45,328 INFO L225 Difference]: With dead ends: 188 [2024-11-10 03:39:45,331 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 03:39:45,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:39:45,333 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 53 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:39:45,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 296 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:39:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 03:39:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2024-11-10 03:39:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 03:39:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2024-11-10 03:39:45,377 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 147 [2024-11-10 03:39:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:45,378 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2024-11-10 03:39:45,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-10 03:39:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2024-11-10 03:39:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:39:45,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:45,381 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] [2024-11-10 03:39:45,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:39:45,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:45,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash 756971732, now seen corresponding path program 1 times [2024-11-10 03:39:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784342456] [2024-11-10 03:39:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:39:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:39:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:39:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:39:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:39:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:39:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:39:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:39:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:39:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:39:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:39:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:39:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:39:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:39:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 03:39:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784342456] [2024-11-10 03:39:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784342456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:39:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227497924] [2024-11-10 03:39:45,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:39:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:39:45,997 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-10 03:39:45,999 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-10 03:39:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:46,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 03:39:46,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:39:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-10 03:39:46,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:39:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 03:39:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227497924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:39:47,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:39:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2024-11-10 03:39:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849009301] [2024-11-10 03:39:47,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:39:47,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 03:39:47,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:47,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 03:39:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-10 03:39:47,025 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-10 03:39:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:47,928 INFO L93 Difference]: Finished difference Result 296 states and 434 transitions. [2024-11-10 03:39:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 03:39:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) Word has length 148 [2024-11-10 03:39:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:47,935 INFO L225 Difference]: With dead ends: 296 [2024-11-10 03:39:47,935 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 03:39:47,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=1069, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 03:39:47,938 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 442 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:39:47,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 542 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:39:47,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 03:39:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 196. [2024-11-10 03:39:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 115 states have internal predecessors, (136), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-10 03:39:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2024-11-10 03:39:47,985 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 148 [2024-11-10 03:39:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:47,985 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2024-11-10 03:39:47,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-10 03:39:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2024-11-10 03:39:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:39:47,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:47,988 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] [2024-11-10 03:39:48,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:39:48,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:39:48,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:48,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1050374739, now seen corresponding path program 1 times [2024-11-10 03:39:48,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:48,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323538297] [2024-11-10 03:39:48,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:39:48,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448834539] [2024-11-10 03:39:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:48,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:39:48,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:39:48,295 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-10 03:39:48,298 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-10 03:39:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:39:48,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:39:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:39:49,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:39:49,172 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:39:49,173 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:39:49,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:39:49,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 03:39:49,378 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:39:49,484 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:39:49,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:39:49 BoogieIcfgContainer [2024-11-10 03:39:49,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:39:49,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:39:49,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:39:49,489 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:39:49,489 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:42" (3/4) ... [2024-11-10 03:39:49,494 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:39:49,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:39:49,498 INFO L158 Benchmark]: Toolchain (without parser) took 7881.19ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 140.3MB in the beginning and 91.5MB in the end (delta: 48.8MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-11-10 03:39:49,498 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:39:49,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.09ms. Allocated memory is still 169.9MB. Free memory was 140.3MB in the beginning and 124.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:39:49,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.33ms. Allocated memory is still 169.9MB. Free memory was 124.0MB in the beginning and 120.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:39:49,499 INFO L158 Benchmark]: Boogie Preprocessor took 65.00ms. Allocated memory is still 169.9MB. Free memory was 120.8MB in the beginning and 115.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 03:39:49,500 INFO L158 Benchmark]: IcfgBuilder took 631.90ms. Allocated memory is still 169.9MB. Free memory was 114.5MB in the beginning and 123.1MB in the end (delta: -8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 03:39:49,501 INFO L158 Benchmark]: TraceAbstraction took 6684.75ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 123.1MB in the beginning and 91.5MB in the end (delta: 31.6MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2024-11-10 03:39:49,501 INFO L158 Benchmark]: Witness Printer took 6.97ms. Allocated memory is still 218.1MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:39:49,503 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.23ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.09ms. Allocated memory is still 169.9MB. Free memory was 140.3MB in the beginning and 124.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.33ms. Allocated memory is still 169.9MB. Free memory was 124.0MB in the beginning and 120.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.00ms. Allocated memory is still 169.9MB. Free memory was 120.8MB in the beginning and 115.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 631.90ms. Allocated memory is still 169.9MB. Free memory was 114.5MB in the beginning and 123.1MB in the end (delta: -8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6684.75ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 123.1MB in the beginning and 91.5MB in the end (delta: 31.6MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Witness Printer took 6.97ms. Allocated memory is still 218.1MB. Free memory is still 91.5MB. 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 132, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_5 = 128; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 128; [L27] signed long int var_1_9 = 1967984875; [L28] float var_1_10 = 256.625; [L29] float var_1_11 = 24.5; [L30] float var_1_12 = 999999.25; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 0; [L33] double var_1_15 = 127.3; [L34] float var_1_16 = 15.8; [L35] double var_1_17 = -0.4; [L36] unsigned long int var_1_18 = 8; [L37] unsigned long int var_1_19 = 2366774301; [L38] unsigned char var_1_20 = 0; [L39] signed short int var_1_21 = 5; [L40] signed char var_1_22 = 0; [L41] signed char var_1_23 = 2; [L42] unsigned char last_1_var_1_1 = 5; [L43] unsigned long int last_1_var_1_18 = 8; [L44] signed char last_1_var_1_22 = 0; VAL [isInitial=0, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=128, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_18 = var_1_18 [L129] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=128, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L139] RET updateLastVariables() [L140] CALL updateVariables() [L89] var_1_5 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L90] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L91] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L91] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L94] CALL assume_abort_if_not(var_1_6 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L94] RET assume_abort_if_not(var_1_6 <= 64) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L96] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L97] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=1967984875] [L97] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=1967984875] [L98] var_1_9 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_9 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L99] RET assume_abort_if_not(var_1_9 >= 1073741822) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L100] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L100] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L101] var_1_11 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L102] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L103] var_1_12 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L104] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L105] var_1_13 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L106] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L107] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L107] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L108] var_1_14 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L109] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L110] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L110] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L111] var_1_16 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L112] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L113] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L113] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L114] var_1_17 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L115] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L116] var_1_19 = __VERIFIER_nondet_ulong() [L117] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L117] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L118] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L118] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L119] var_1_20 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L121] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L121] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L122] var_1_23 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_23 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L123] RET assume_abort_if_not(var_1_23 >= -63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L124] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L124] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L140] RET updateVariables() [L141] CALL step() [L48] unsigned char stepLocal_2 = var_1_9 >= last_1_var_1_22; [L49] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_1=5, stepLocal_2=1, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L50] COND FALSE !(stepLocal_1 > last_1_var_1_18) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_2=1, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L53] COND TRUE var_1_20 || stepLocal_2 [L54] var_1_18 = var_1_6 VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=5, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L59] COND TRUE last_1_var_1_1 > (var_1_18 * var_1_18) [L60] var_1_1 = (var_1_5 - (var_1_6 + var_1_7)) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=5, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L64] var_1_21 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) [L65] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_0=-254, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=128, var_1_9=2147483646] [L66] COND TRUE (- var_1_18) > stepLocal_0 [L67] var_1_8 = ((var_1_9 - var_1_21) - var_1_5) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L69] signed long int stepLocal_3 = var_1_8; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_3=2147483330, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L70] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L77] COND TRUE var_1_8 != ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))) [L78] var_1_10 = ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L84] COND TRUE (var_1_12 / var_1_16) >= var_1_10 [L85] var_1_15 = (var_1_17 + 255.5) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return (((((((last_1_var_1_1 > (var_1_18 * var_1_18)) ? (var_1_1 == ((unsigned char) (var_1_5 - (var_1_6 + var_1_7)))) : (var_1_1 == ((unsigned char) ((((var_1_7) < ((((((16) < 0 ) ? -(16) : (16))) + var_1_6))) ? (var_1_7) : ((((((16) < 0 ) ? -(16) : (16))) + var_1_6))))))) && (((- var_1_18) > var_1_6) ? (var_1_8 == ((signed long int) ((var_1_9 - var_1_21) - var_1_5))) : 1)) && ((var_1_8 != ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5)))) ? (var_1_10 == ((float) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : ((var_1_13 || var_1_14) ? (var_1_10 == ((float) var_1_11)) : 1))) && (((var_1_12 / var_1_16) >= var_1_10) ? (var_1_15 == ((double) (var_1_17 + 255.5))) : 1)) && ((last_1_var_1_1 > last_1_var_1_18) ? (var_1_18 == ((unsigned long int) ((((var_1_9) < ((var_1_19 - var_1_6))) ? (var_1_9) : ((var_1_19 - var_1_6)))))) : ((var_1_20 || (var_1_9 >= last_1_var_1_22)) ? (var_1_18 == ((unsigned long int) var_1_6)) : (var_1_18 == ((unsigned long int) var_1_7))))) && (var_1_21 == ((signed short int) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) && ((var_1_18 == var_1_8) ? ((! var_1_20) ? (var_1_22 == ((signed char) ((((var_1_6) > ((5 - var_1_7))) ? (var_1_6) : ((5 - var_1_7)))))) : (var_1_22 == ((signed char) (var_1_7 + var_1_23)))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=2147483647, var_1_1=190, var_1_20=1, var_1_21=62, var_1_22=0, var_1_23=-63, var_1_5=-2, var_1_6=-254, var_1_7=-194, var_1_8=2147483330, var_1_9=2147483646] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 933 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 263 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 2376 SizeOfPredicates, 4 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4916/5060 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-10 03:39:49,539 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.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 2f939a31bde08313e00f5c944adf142fba63d3542c78032e0ba52b2cc30f6848 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:39:51,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:39:51,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:39:52,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:39:52,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:39:52,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:39:52,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:39:52,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:39:52,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:39:52,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:39:52,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:39:52,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:39:52,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:39:52,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:39:52,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:39:52,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:39:52,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:39:52,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:39:52,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:39:52,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:39:52,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:39:52,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:39:52,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:39:52,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:39:52,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:39:52,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:39:52,054 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:39:52,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:39:52,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:39:52,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:39:52,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:39:52,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:39:52,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:39:52,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:39:52,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:52,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:39:52,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:39:52,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:39:52,058 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:39:52,059 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:39:52,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:39:52,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:39:52,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:39:52,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:39:52,060 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 -> 2f939a31bde08313e00f5c944adf142fba63d3542c78032e0ba52b2cc30f6848 [2024-11-10 03:39:52,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:39:52,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:39:52,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:39:52,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:39:52,442 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:39:52,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i [2024-11-10 03:39:54,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:39:54,336 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:39:54,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i [2024-11-10 03:39:54,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e490f2ef6/92ad866a495f4317abb21e9eba87faa8/FLAG211daa72e [2024-11-10 03:39:54,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e490f2ef6/92ad866a495f4317abb21e9eba87faa8 [2024-11-10 03:39:54,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:39:54,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:39:54,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:54,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:39:54,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:39:54,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4106cda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54, skipping insertion in model container [2024-11-10 03:39:54,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:39:54,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i[913,926] [2024-11-10 03:39:54,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:54,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:39:54,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-12.i[913,926] [2024-11-10 03:39:54,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:54,809 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:39:54,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54 WrapperNode [2024-11-10 03:39:54,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:54,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:54,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:39:54,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:39:54,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,873 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-10 03:39:54,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:54,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:39:54,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:39:54,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:39:54,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,913 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-10 03:39:54,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:39:54,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:39:54,953 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:39:54,953 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:39:54,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (1/1) ... [2024-11-10 03:39:54,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:39:54,993 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-10 03:39:54,999 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-10 03:39:55,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:39:55,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:39:55,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:39:55,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:39:55,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:39:55,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:39:55,157 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:39:55,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:40:00,322 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 03:40:00,323 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:40:00,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:40:00,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:40:00,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:40:00 BoogieIcfgContainer [2024-11-10 03:40:00,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:40:00,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:40:00,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:40:00,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:40:00,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:39:54" (1/3) ... [2024-11-10 03:40:00,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c173563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:40:00, skipping insertion in model container [2024-11-10 03:40:00,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:54" (2/3) ... [2024-11-10 03:40:00,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c173563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:40:00, skipping insertion in model container [2024-11-10 03:40:00,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:40:00" (3/3) ... [2024-11-10 03:40:00,349 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-12.i [2024-11-10 03:40:00,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:40:00,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:40:00,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:40:00,456 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;@7e7760fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:40:00,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:40:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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-10 03:40:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 03:40:00,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:40:00,474 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] [2024-11-10 03:40:00,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:40:00,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:40:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1163729006, now seen corresponding path program 1 times [2024-11-10 03:40:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:40:00,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234243592] [2024-11-10 03:40:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:40:00,494 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-10 03:40:00,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:40:00,497 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-10 03:40:00,500 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-10 03:40:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:00,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:40:00,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:40:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-10 03:40:00,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:40:00,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:40:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234243592] [2024-11-10 03:40:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234243592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:40:00,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:40:00,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:40:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237550286] [2024-11-10 03:40:00,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:40:01,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:40:01,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:40:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:40:01,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:40:01,041 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-10 03:40:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:40:01,078 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2024-11-10 03:40:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:40:01,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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 147 [2024-11-10 03:40:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:40:01,089 INFO L225 Difference]: With dead ends: 130 [2024-11-10 03:40:01,090 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 03:40:01,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-10 03:40:01,100 INFO L432 NwaCegarLoop]: 95 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, 95 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-10 03:40:01,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:40:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 03:40:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 03:40:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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-10 03:40:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-10 03:40:01,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 147 [2024-11-10 03:40:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:40:01,146 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-10 03:40:01,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (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-10 03:40:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-10 03:40:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 03:40:01,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:40:01,152 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] [2024-11-10 03:40:01,167 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-10 03:40:01,353 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-10 03:40:01,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:40:01,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:40:01,354 INFO L85 PathProgramCache]: Analyzing trace with hash 944211919, now seen corresponding path program 1 times [2024-11-10 03:40:01,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:40:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451447234] [2024-11-10 03:40:01,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:40:01,356 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-10 03:40:01,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:40:01,358 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-10 03:40:01,359 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-10 03:40:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:01,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 03:40:01,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:40:04,477 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-10 03:40:04,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:40:04,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:40:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451447234] [2024-11-10 03:40:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451447234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:40:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:40:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:40:04,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149493] [2024-11-10 03:40:04,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:40:04,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:40:04,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:40:04,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:40:04,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:40:04,482 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-10 03:40:06,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:40:08,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:40:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:40:08,315 INFO L93 Difference]: Finished difference Result 188 states and 281 transitions. [2024-11-10 03:40:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:40:08,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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 147 [2024-11-10 03:40:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:40:08,350 INFO L225 Difference]: With dead ends: 188 [2024-11-10 03:40:08,350 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 03:40:08,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:40:08,352 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:40:08,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 296 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-10 03:40:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 03:40:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2024-11-10 03:40:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 03:40:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2024-11-10 03:40:08,393 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 147 [2024-11-10 03:40:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:40:08,400 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2024-11-10 03:40:08,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-10 03:40:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2024-11-10 03:40:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:40:08,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:40:08,404 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] [2024-11-10 03:40:08,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:40:08,605 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-10 03:40:08,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:40:08,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:40:08,607 INFO L85 PathProgramCache]: Analyzing trace with hash 756971732, now seen corresponding path program 1 times [2024-11-10 03:40:08,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:40:08,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536894766] [2024-11-10 03:40:08,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:40:08,608 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-10 03:40:08,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:40:08,611 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-10 03:40:08,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:40:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:08,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 03:40:08,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:40:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-10 03:40:11,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:40:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 03:40:12,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:40:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536894766] [2024-11-10 03:40:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536894766] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:40:12,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:40:12,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-11-10 03:40:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299774254] [2024-11-10 03:40:12,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:40:12,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:40:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:40:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:40:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:40:12,821 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-10 03:40:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:40:17,600 INFO L93 Difference]: Finished difference Result 294 states and 432 transitions. [2024-11-10 03:40:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 03:40:17,601 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 148 [2024-11-10 03:40:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:40:17,605 INFO L225 Difference]: With dead ends: 294 [2024-11-10 03:40:17,605 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 03:40:17,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2024-11-10 03:40:17,607 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 399 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:40:17,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 443 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-10 03:40:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 03:40:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2024-11-10 03:40:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 115 states have internal predecessors, (136), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-10 03:40:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2024-11-10 03:40:17,664 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 148 [2024-11-10 03:40:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:40:17,667 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2024-11-10 03:40:17,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-10 03:40:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2024-11-10 03:40:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:40:17,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:40:17,670 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] [2024-11-10 03:40:17,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 03:40:17,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:40:17,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:40:17,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:40:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1050374739, now seen corresponding path program 1 times [2024-11-10 03:40:17,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:40:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194506504] [2024-11-10 03:40:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:40:17,873 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-10 03:40:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:40:17,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:40:17,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 03:40:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:40:18,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 03:40:18,241 INFO L278 TraceCheckSpWp]: Computing forward predicates...