./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.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 e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:46:10,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:46:10,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:46:10,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:46:10,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:46:11,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:46:11,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:46:11,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:46:11,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:46:11,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:46:11,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:46:11,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:46:11,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:46:11,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:46:11,018 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:46:11,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:46:11,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:46:11,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:46:11,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:46:11,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:46:11,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:46:11,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:46:11,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:46:11,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:46:11,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:46:11,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:46:11,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:46:11,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:46:11,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:46:11,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:46:11,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:46:11,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:46:11,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:46:11,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:46:11,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:46:11,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:46:11,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:46:11,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:46:11,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:46:11,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:46:11,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:46:11,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:46:11,027 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 -> e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d [2024-10-12 23:46:11,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:46:11,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:46:11,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:46:11,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:46:11,295 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:46:11,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-10-12 23:46:12,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:46:12,800 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:46:12,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-10-12 23:46:12,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597ab402a/0afb4b03fd6647d38682531977a496d1/FLAGe09e4f422 [2024-10-12 23:46:13,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597ab402a/0afb4b03fd6647d38682531977a496d1 [2024-10-12 23:46:13,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:46:13,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:46:13,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:46:13,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:46:13,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:46:13,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2191fe16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13, skipping insertion in model container [2024-10-12 23:46:13,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:46:13,361 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-10-12 23:46:13,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:46:13,412 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:46:13,429 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-10-12 23:46:13,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:46:13,492 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:46:13,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13 WrapperNode [2024-10-12 23:46:13,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:46:13,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:46:13,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:46:13,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:46:13,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,547 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-10-12 23:46:13,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:46:13,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:46:13,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:46:13,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:46:13,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,593 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:46:13,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:46:13,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:46:13,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:46:13,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:46:13,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (1/1) ... [2024-10-12 23:46:13,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:46:13,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:46:13,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:46:13,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:46:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:46:13,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:46:13,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:46:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:46:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:46:13,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:46:13,822 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:46:13,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:46:14,042 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:46:14,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:46:14,084 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:46:14,086 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:46:14,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:46:14 BoogieIcfgContainer [2024-10-12 23:46:14,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:46:14,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:46:14,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:46:14,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:46:14,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:46:13" (1/3) ... [2024-10-12 23:46:14,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f79d309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:46:14, skipping insertion in model container [2024-10-12 23:46:14,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:13" (2/3) ... [2024-10-12 23:46:14,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f79d309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:46:14, skipping insertion in model container [2024-10-12 23:46:14,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:46:14" (3/3) ... [2024-10-12 23:46:14,096 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-13.i [2024-10-12 23:46:14,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:46:14,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:46:14,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:46:14,163 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;@7aa16d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:46:14,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:46:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-12 23:46:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 23:46:14,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:14,177 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:14,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -464185333, now seen corresponding path program 1 times [2024-10-12 23:46:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:46:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520470576] [2024-10-12 23:46:14,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:46:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:46:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:46:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:46:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:46:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:46:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:46:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:46:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:46:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:46:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:46:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:46:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:46:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:46:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:46:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:46:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:46:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:46:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:46:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:46:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 23:46:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-12 23:46:14,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:46:14,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520470576] [2024-10-12 23:46:14,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520470576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:46:14,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:46:14,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:46:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622019779] [2024-10-12 23:46:14,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:46:14,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:46:14,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:46:14,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:46:14,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:46:14,501 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-12 23:46:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:46:14,559 INFO L93 Difference]: Finished difference Result 119 states and 208 transitions. [2024-10-12 23:46:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:46:14,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2024-10-12 23:46:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:46:14,578 INFO L225 Difference]: With dead ends: 119 [2024-10-12 23:46:14,579 INFO L226 Difference]: Without dead ends: 59 [2024-10-12 23:46:14,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:46:14,587 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:46:14,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:46:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-12 23:46:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-12 23:46:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-12 23:46:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-12 23:46:14,641 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 128 [2024-10-12 23:46:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:46:14,642 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-12 23:46:14,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-12 23:46:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-12 23:46:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 23:46:14,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:14,646 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:14,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:46:14,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:14,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1697178115, now seen corresponding path program 1 times [2024-10-12 23:46:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:46:14,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779342420] [2024-10-12 23:46:14,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:46:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:46:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:46:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:46:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:46:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:46:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:46:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:46:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:46:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:46:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:46:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:46:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:46:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:46:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:46:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:46:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:46:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:46:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:46:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:46:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 23:46:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-12 23:46:14,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:46:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779342420] [2024-10-12 23:46:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779342420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:46:14,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:46:14,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:46:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112990046] [2024-10-12 23:46:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:46:14,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:46:14,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:46:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:46:14,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:46:14,960 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:46:15,009 INFO L93 Difference]: Finished difference Result 147 states and 219 transitions. [2024-10-12 23:46:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:46:15,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2024-10-12 23:46:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:46:15,012 INFO L225 Difference]: With dead ends: 147 [2024-10-12 23:46:15,014 INFO L226 Difference]: Without dead ends: 89 [2024-10-12 23:46:15,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:46:15,016 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 36 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:46:15,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:46:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-12 23:46:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-10-12 23:46:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 58 states have internal predecessors, (76), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 23:46:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2024-10-12 23:46:15,041 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 128 transitions. Word has length 128 [2024-10-12 23:46:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:46:15,043 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 128 transitions. [2024-10-12 23:46:15,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 128 transitions. [2024-10-12 23:46:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 23:46:15,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:15,046 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:15,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:46:15,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:15,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1955343553, now seen corresponding path program 1 times [2024-10-12 23:46:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:46:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943761432] [2024-10-12 23:46:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:46:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:46:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:46:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:46:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:46:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:46:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:46:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:46:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:46:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:46:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:46:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:46:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:46:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:46:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:46:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:46:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:46:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:46:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:46:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:46:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 23:46:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-12 23:46:15,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:46:15,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943761432] [2024-10-12 23:46:15,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943761432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:46:15,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:46:15,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:46:15,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816585449] [2024-10-12 23:46:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:46:15,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:46:15,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:46:15,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:46:15,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:46:15,539 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:46:15,802 INFO L93 Difference]: Finished difference Result 246 states and 368 transitions. [2024-10-12 23:46:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:46:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2024-10-12 23:46:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:46:15,806 INFO L225 Difference]: With dead ends: 246 [2024-10-12 23:46:15,806 INFO L226 Difference]: Without dead ends: 161 [2024-10-12 23:46:15,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-10-12 23:46:15,808 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 64 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:46:15,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 267 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:46:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-12 23:46:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 125. [2024-10-12 23:46:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-12 23:46:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2024-10-12 23:46:15,845 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 128 [2024-10-12 23:46:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:46:15,846 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2024-10-12 23:46:15,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2024-10-12 23:46:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 23:46:15,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:15,851 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:15,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:46:15,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:15,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash 333721284, now seen corresponding path program 1 times [2024-10-12 23:46:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:46:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922994465] [2024-10-12 23:46:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:15,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:46:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:15,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:46:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:46:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:46:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:46:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:46:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:46:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:46:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:46:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:46:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:46:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:46:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:46:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:46:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:46:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:46:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:46:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:46:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:46:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:46:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 23:46:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-12 23:46:16,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:46:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922994465] [2024-10-12 23:46:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922994465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:46:16,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:46:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:46:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309951376] [2024-10-12 23:46:16,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:46:16,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:46:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:46:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:46:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:46:16,120 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:46:16,253 INFO L93 Difference]: Finished difference Result 243 states and 362 transitions. [2024-10-12 23:46:16,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:46:16,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-10-12 23:46:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:46:16,257 INFO L225 Difference]: With dead ends: 243 [2024-10-12 23:46:16,258 INFO L226 Difference]: Without dead ends: 158 [2024-10-12 23:46:16,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:46:16,259 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:46:16,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 104 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:46:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-12 23:46:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2024-10-12 23:46:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 79 states have internal predecessors, (99), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-12 23:46:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-10-12 23:46:16,294 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 129 [2024-10-12 23:46:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:46:16,295 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-10-12 23:46:16,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-10-12 23:46:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 23:46:16,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:16,296 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:16,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:46:16,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1034785862, now seen corresponding path program 1 times [2024-10-12 23:46:16,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:46:16,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501043599] [2024-10-12 23:46:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:46:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 23:46:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600867043] [2024-10-12 23:46:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:16,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:46:16,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:46:16,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:46:16,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 23:46:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:46:16,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:46:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:46:16,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:46:16,596 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:46:16,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:46:16,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 23:46:16,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:46:16,802 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-12 23:46:16,879 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:46:16,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:46:16 BoogieIcfgContainer [2024-10-12 23:46:16,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:46:16,883 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:46:16,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:46:16,884 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:46:16,884 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:46:14" (3/4) ... [2024-10-12 23:46:16,886 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:46:16,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:46:16,888 INFO L158 Benchmark]: Toolchain (without parser) took 3689.85ms. Allocated memory was 220.2MB in the beginning and 295.7MB in the end (delta: 75.5MB). Free memory was 150.9MB in the beginning and 192.7MB in the end (delta: -41.8MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-10-12 23:46:16,892 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:46:16,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.97ms. Allocated memory is still 220.2MB. Free memory was 150.6MB in the beginning and 135.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 23:46:16,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.41ms. Allocated memory is still 220.2MB. Free memory was 135.4MB in the beginning and 132.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:46:16,893 INFO L158 Benchmark]: Boogie Preprocessor took 54.30ms. Allocated memory is still 220.2MB. Free memory was 132.0MB in the beginning and 126.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:46:16,893 INFO L158 Benchmark]: RCFGBuilder took 479.54ms. Allocated memory is still 220.2MB. Free memory was 126.6MB in the beginning and 167.8MB in the end (delta: -41.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-12 23:46:16,893 INFO L158 Benchmark]: TraceAbstraction took 2794.33ms. Allocated memory was 220.2MB in the beginning and 295.7MB in the end (delta: 75.5MB). Free memory was 166.6MB in the beginning and 193.8MB in the end (delta: -27.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-10-12 23:46:16,894 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 295.7MB. Free memory is still 192.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:46:16,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.97ms. Allocated memory is still 220.2MB. Free memory was 150.6MB in the beginning and 135.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.41ms. Allocated memory is still 220.2MB. Free memory was 135.4MB in the beginning and 132.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.30ms. Allocated memory is still 220.2MB. Free memory was 132.0MB in the beginning and 126.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 479.54ms. Allocated memory is still 220.2MB. Free memory was 126.6MB in the beginning and 167.8MB in the end (delta: -41.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2794.33ms. Allocated memory was 220.2MB in the beginning and 295.7MB in the end (delta: 75.5MB). Free memory was 166.6MB in the beginning and 193.8MB in the end (delta: -27.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 295.7MB. Free memory is still 192.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of shiftRight at line 123. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] signed short int last_1_var_1_21 = -64; [L43] unsigned char last_1_var_1_22 = 25; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L119] last_1_var_1_21 = var_1_21 [L120] last_1_var_1_22 = var_1_22 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L88] var_1_5 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L95] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L96] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L97] var_1_10 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L100] var_1_11 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L102] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L105] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] var_1_17 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_17 >= 0.0F && 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_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not((var_1_17 >= 0.0F && 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_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L111] var_1_18 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L113] var_1_19 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L115] var_1_20 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L131] RET updateVariables() [L132] CALL step() [L47] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L47] COND TRUE (~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4) [L48] COND TRUE var_1_5 || var_1_6 [L49] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L56] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L59] COND FALSE !(var_1_4 > var_1_1) [L62] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L64] COND TRUE ((- var_1_11) < 8) || var_1_9 [L65] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L67] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L68] COND TRUE var_1_18 <= var_1_20 [L69] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L75] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L80] COND TRUE var_1_10 > var_1_21 [L81] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L123-L124] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=-193, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 650 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 348 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 69 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 1515 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:46:16,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.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 e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:46:18,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:46:18,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 23:46:18,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:46:18,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:46:18,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:46:18,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:46:18,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:46:18,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:46:18,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:46:18,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:46:18,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:46:18,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:46:18,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:46:18,992 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:46:18,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:46:18,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:46:18,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:46:18,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:46:18,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:46:18,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:46:18,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:46:18,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:46:18,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:46:18,999 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:46:19,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:46:19,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:46:19,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:46:19,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:46:19,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:46:19,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:46:19,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:46:19,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:46:19,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:46:19,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:46:19,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:46:19,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:46:19,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:46:19,002 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:46:19,003 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:46:19,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:46:19,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:46:19,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:46:19,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:46:19,005 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:46:19,005 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 -> e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d [2024-10-12 23:46:19,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:46:19,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:46:19,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:46:19,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:46:19,340 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:46:19,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-10-12 23:46:20,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:46:20,935 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:46:20,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-10-12 23:46:20,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb565983/bb6a0696dfc9417b8b20b4d93cc1a5d9/FLAG03545f93e [2024-10-12 23:46:21,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb565983/bb6a0696dfc9417b8b20b4d93cc1a5d9 [2024-10-12 23:46:21,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:46:21,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:46:21,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:46:21,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:46:21,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:46:21,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25900bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21, skipping insertion in model container [2024-10-12 23:46:21,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:46:21,525 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-10-12 23:46:21,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:46:21,600 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:46:21,609 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-10-12 23:46:21,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:46:21,660 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:46:21,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21 WrapperNode [2024-10-12 23:46:21,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:46:21,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:46:21,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:46:21,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:46:21,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,712 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-12 23:46:21,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:46:21,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:46:21,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:46:21,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:46:21,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,743 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:46:21,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:46:21,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:46:21,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:46:21,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:46:21,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (1/1) ... [2024-10-12 23:46:21,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:46:21,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:46:21,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:46:21,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:46:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:46:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:46:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:46:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:46:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:46:21,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:46:21,933 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:46:21,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:46:26,025 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:46:26,029 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:46:26,124 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:46:26,129 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:46:26,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:46:26 BoogieIcfgContainer [2024-10-12 23:46:26,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:46:26,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:46:26,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:46:26,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:46:26,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:46:21" (1/3) ... [2024-10-12 23:46:26,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60701db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:46:26, skipping insertion in model container [2024-10-12 23:46:26,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:46:21" (2/3) ... [2024-10-12 23:46:26,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60701db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:46:26, skipping insertion in model container [2024-10-12 23:46:26,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:46:26" (3/3) ... [2024-10-12 23:46:26,145 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-13.i [2024-10-12 23:46:26,168 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:46:26,172 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:46:26,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:46:26,276 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;@404ab68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:46:26,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:46:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-12 23:46:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 23:46:26,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:26,296 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:26,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 687622240, now seen corresponding path program 1 times [2024-10-12 23:46:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:46:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070372160] [2024-10-12 23:46:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:26,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:46:26,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:46:26,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:46:26,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:46:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:26,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 23:46:26,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:46:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-10-12 23:46:26,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:46:26,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:46:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070372160] [2024-10-12 23:46:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070372160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:46:26,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:46:26,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:46:26,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188539989] [2024-10-12 23:46:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:46:26,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:46:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:46:26,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:46:26,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:46:26,780 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-12 23:46:30,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:46:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:46:30,447 INFO L93 Difference]: Finished difference Result 109 states and 194 transitions. [2024-10-12 23:46:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:46:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-10-12 23:46:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:46:30,483 INFO L225 Difference]: With dead ends: 109 [2024-10-12 23:46:30,483 INFO L226 Difference]: Without dead ends: 54 [2024-10-12 23:46:30,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:46:30,489 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 23:46:30,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 23:46:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-12 23:46:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-12 23:46:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-12 23:46:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2024-10-12 23:46:30,521 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 125 [2024-10-12 23:46:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:46:30,521 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2024-10-12 23:46:30,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-12 23:46:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2024-10-12 23:46:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 23:46:30,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:30,524 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:30,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:46:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:46:30,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:30,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2089451160, now seen corresponding path program 1 times [2024-10-12 23:46:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:46:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443482682] [2024-10-12 23:46:30,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:46:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:46:30,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:46:30,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:46:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:30,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 23:46:30,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:46:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-12 23:46:32,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:46:32,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:46:32,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443482682] [2024-10-12 23:46:32,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443482682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:46:32,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:46:32,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:46:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361064264] [2024-10-12 23:46:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:46:32,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:46:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:46:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:46:32,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:46:32,099 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:34,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:46:36,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:46:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:46:36,343 INFO L93 Difference]: Finished difference Result 161 states and 245 transitions. [2024-10-12 23:46:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:46:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-12 23:46:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:46:36,366 INFO L225 Difference]: With dead ends: 161 [2024-10-12 23:46:36,367 INFO L226 Difference]: Without dead ends: 108 [2024-10-12 23:46:36,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:46:36,368 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:46:36,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 227 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 23:46:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-12 23:46:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2024-10-12 23:46:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-12 23:46:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2024-10-12 23:46:36,389 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 125 [2024-10-12 23:46:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:46:36,390 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions. [2024-10-12 23:46:36,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2024-10-12 23:46:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 23:46:36,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:36,392 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:36,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:46:36,601 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-10-12 23:46:36,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:36,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1642386676, now seen corresponding path program 1 times [2024-10-12 23:46:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:46:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194952997] [2024-10-12 23:46:36,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:36,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:46:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:46:36,607 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-10-12 23:46:36,609 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-10-12 23:46:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:36,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 23:46:36,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:46:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 23:46:37,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:46:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-12 23:46:37,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:46:37,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194952997] [2024-10-12 23:46:37,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194952997] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 23:46:37,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 23:46:37,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 23:46:37,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021671643] [2024-10-12 23:46:37,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:46:37,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:46:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:46:37,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:46:37,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:46:37,571 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:39,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:46:41,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:46:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:46:41,332 INFO L93 Difference]: Finished difference Result 160 states and 242 transitions. [2024-10-12 23:46:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:46:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-12 23:46:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:46:41,334 INFO L225 Difference]: With dead ends: 160 [2024-10-12 23:46:41,334 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 23:46:41,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:46:41,335 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 19 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 23:46:41,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 139 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 23:46:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 23:46:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2024-10-12 23:46:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-12 23:46:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2024-10-12 23:46:41,361 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 126 [2024-10-12 23:46:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:46:41,361 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2024-10-12 23:46:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-12 23:46:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2024-10-12 23:46:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 23:46:41,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:46:41,363 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:46:41,377 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-10-12 23:46:41,567 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-10-12 23:46:41,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:46:41,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:46:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -962328306, now seen corresponding path program 1 times [2024-10-12 23:46:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:46:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562712406] [2024-10-12 23:46:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:46:41,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:46:41,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:46:41,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:46:41,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 23:46:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:46:41,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 23:46:41,832 INFO L278 TraceCheckSpWp]: Computing forward predicates...