./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.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 2179a43a83e486ac9d5e9c9fcb73d284bce02d99497a2b587e68e71bd6344001 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:16:19,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:16:19,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:16:19,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:16:19,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:16:19,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:16:19,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:16:19,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:16:19,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:16:19,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:16:19,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:16:19,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:16:19,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:16:19,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:16:19,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:16:19,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:16:19,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:16:19,223 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:16:19,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:16:19,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:16:19,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:16:19,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:16:19,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:16:19,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:16:19,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:16:19,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:16:19,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:16:19,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:16:19,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:16:19,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:16:19,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:16:19,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:16:19,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:16:19,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:16:19,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:16:19,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:16:19,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:16:19,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:16:19,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:16:19,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:16:19,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:16:19,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:16:19,229 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 -> 2179a43a83e486ac9d5e9c9fcb73d284bce02d99497a2b587e68e71bd6344001 [2024-11-10 03:16:19,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:16:19,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:16:19,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:16:19,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:16:19,451 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:16:19,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i [2024-11-10 03:16:20,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:16:20,864 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:16:20,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i [2024-11-10 03:16:20,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14d939de2/f58e2bd007ef4483ba4a62135507a71d/FLAGcf5dceb1f [2024-11-10 03:16:20,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14d939de2/f58e2bd007ef4483ba4a62135507a71d [2024-11-10 03:16:20,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:16:20,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:16:20,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:16:20,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:16:20,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:16:20,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:20" (1/1) ... [2024-11-10 03:16:20,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101f9bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:20, skipping insertion in model container [2024-11-10 03:16:20,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:20" (1/1) ... [2024-11-10 03:16:20,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:16:21,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i[919,932] [2024-11-10 03:16:21,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:16:21,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:16:21,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i[919,932] [2024-11-10 03:16:21,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:16:21,193 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:16:21,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21 WrapperNode [2024-11-10 03:16:21,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:16:21,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:16:21,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:16:21,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:16:21,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,239 INFO L138 Inliner]: procedures = 31, calls = 49, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 199 [2024-11-10 03:16:21,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:16:21,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:16:21,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:16:21,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:16:21,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,277 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:16:21,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:16:21,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:16:21,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:16:21,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:16:21,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (1/1) ... [2024-11-10 03:16:21,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:16:21,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:16:21,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:16:21,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:16:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:16:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:16:21,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:16:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:16:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:16:21,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:16:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure functionized4 [2024-11-10 03:16:21,382 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized4 [2024-11-10 03:16:21,451 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:16:21,453 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:16:21,742 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 03:16:21,742 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:16:21,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:16:21,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:16:21,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:21 BoogieIcfgContainer [2024-11-10 03:16:21,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:16:21,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:16:21,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:16:21,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:16:21,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:16:20" (1/3) ... [2024-11-10 03:16:21,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fce2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:16:21, skipping insertion in model container [2024-11-10 03:16:21,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:21" (2/3) ... [2024-11-10 03:16:21,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fce2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:16:21, skipping insertion in model container [2024-11-10 03:16:21,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:21" (3/3) ... [2024-11-10 03:16:21,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-4.i [2024-11-10 03:16:21,785 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:16:21,785 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:16:21,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:16:21,848 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;@71c82ab6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:16:21,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:16:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 59 states have internal predecessors, (76), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 03:16:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 03:16:21,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:21,866 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:21,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:21,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash 589611548, now seen corresponding path program 1 times [2024-11-10 03:16:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:16:21,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969813374] [2024-11-10 03:16:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:16:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:16:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:16:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:16:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:16:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:16:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:16:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:16:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:16:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:16:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:16:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:16:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:16:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:16:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:16:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:16:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:16:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:16:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:16:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:16:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:16:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:16:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:16:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:16:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:16:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:16:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:16:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:16:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:16:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 03:16:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 03:16:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 03:16:22,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:16:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969813374] [2024-11-10 03:16:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969813374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:16:22,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:16:22,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:16:22,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402813433] [2024-11-10 03:16:22,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:16:22,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:16:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:16:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:16:22,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:16:22,373 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 59 states have internal predecessors, (76), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:16:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:22,401 INFO L93 Difference]: Finished difference Result 180 states and 303 transitions. [2024-11-10 03:16:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:16:22,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 185 [2024-11-10 03:16:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:22,410 INFO L225 Difference]: With dead ends: 180 [2024-11-10 03:16:22,411 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 03:16:22,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:16:22,416 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:22,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:16:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 03:16:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 03:16:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 03:16:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-11-10 03:16:22,461 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 185 [2024-11-10 03:16:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:22,461 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-11-10 03:16:22,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:16:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-11-10 03:16:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 03:16:22,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:22,465 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:22,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:16:22,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:22,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1401367066, now seen corresponding path program 1 times [2024-11-10 03:16:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:16:22,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275173204] [2024-11-10 03:16:22,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:22,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:16:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:16:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:16:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:16:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:16:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:16:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:16:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:16:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:16:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:16:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:16:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:16:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:16:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:16:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:16:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:16:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:16:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:16:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:16:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:16:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:16:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:16:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:16:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:16:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:16:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:16:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:16:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:16:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:16:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 03:16:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 03:16:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 03:16:23,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:16:23,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275173204] [2024-11-10 03:16:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275173204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:16:23,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:16:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:16:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747279203] [2024-11-10 03:16:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:16:23,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:16:23,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:16:23,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:16:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:16:23,106 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 03:16:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:23,471 INFO L93 Difference]: Finished difference Result 340 states and 495 transitions. [2024-11-10 03:16:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:16:23,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2024-11-10 03:16:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:23,475 INFO L225 Difference]: With dead ends: 340 [2024-11-10 03:16:23,475 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 03:16:23,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:16:23,477 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 234 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:23,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 702 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:16:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 03:16:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 243. [2024-11-10 03:16:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 158 states have (on average 1.2531645569620253) internal successors, (198), 160 states have internal predecessors, (198), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-10 03:16:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 350 transitions. [2024-11-10 03:16:23,518 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 350 transitions. Word has length 185 [2024-11-10 03:16:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:23,518 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 350 transitions. [2024-11-10 03:16:23,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 03:16:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 350 transitions. [2024-11-10 03:16:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 03:16:23,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:23,521 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:23,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:16:23,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:23,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash -45772284, now seen corresponding path program 1 times [2024-11-10 03:16:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:16:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655960585] [2024-11-10 03:16:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:16:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:16:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:16:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:16:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:16:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:16:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:16:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:16:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:16:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:16:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:16:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:16:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:16:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:16:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:16:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:16:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:16:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:16:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:16:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:16:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:16:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:16:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:16:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:16:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:16:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:16:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:16:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:16:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:16:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 03:16:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 03:16:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:16:24,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:16:24,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655960585] [2024-11-10 03:16:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655960585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:16:24,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125283574] [2024-11-10 03:16:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:24,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:16:24,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:16:24,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:16:24,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:16:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:24,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 03:16:24,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:16:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-11-10 03:16:24,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:16:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:16:25,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125283574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:16:25,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:16:25,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 18 [2024-11-10 03:16:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023867055] [2024-11-10 03:16:25,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:16:25,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 03:16:25,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:16:25,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 03:16:25,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-10 03:16:25,129 INFO L87 Difference]: Start difference. First operand 243 states and 350 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-10 03:16:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:26,199 INFO L93 Difference]: Finished difference Result 553 states and 767 transitions. [2024-11-10 03:16:26,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-10 03:16:26,200 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 186 [2024-11-10 03:16:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:26,204 INFO L225 Difference]: With dead ends: 553 [2024-11-10 03:16:26,206 INFO L226 Difference]: Without dead ends: 313 [2024-11-10 03:16:26,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=444, Invalid=1812, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 03:16:26,209 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 499 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:26,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 817 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:16:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-10 03:16:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 227. [2024-11-10 03:16:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 146 states have (on average 1.1849315068493151) internal successors, (173), 148 states have internal predecessors, (173), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 03:16:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 317 transitions. [2024-11-10 03:16:26,241 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 317 transitions. Word has length 186 [2024-11-10 03:16:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:26,242 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 317 transitions. [2024-11-10 03:16:26,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-10 03:16:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 317 transitions. [2024-11-10 03:16:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 03:16:26,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:26,246 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:26,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:16:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:16:26,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1631793443, now seen corresponding path program 1 times [2024-11-10 03:16:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:16:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846830984] [2024-11-10 03:16:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:16:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:16:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14597161] [2024-11-10 03:16:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:26,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:16:26,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:16:26,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:16:26,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:16:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:16:26,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:16:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:16:26,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:16:26,730 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:16:26,731 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:16:26,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:16:26,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 03:16:26,939 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:16:27,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:16:27,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:16:27 BoogieIcfgContainer [2024-11-10 03:16:27,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:16:27,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:16:27,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:16:27,038 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:16:27,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:21" (3/4) ... [2024-11-10 03:16:27,040 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:16:27,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:16:27,041 INFO L158 Benchmark]: Toolchain (without parser) took 6153.83ms. Allocated memory was 148.9MB in the beginning and 230.7MB in the end (delta: 81.8MB). Free memory was 77.3MB in the beginning and 166.7MB in the end (delta: -89.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:16:27,042 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:16:27,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.32ms. Allocated memory is still 148.9MB. Free memory was 77.1MB in the beginning and 111.0MB in the end (delta: -34.0MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-11-10 03:16:27,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.76ms. Allocated memory is still 148.9MB. Free memory was 111.0MB in the beginning and 107.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:16:27,042 INFO L158 Benchmark]: Boogie Preprocessor took 60.00ms. Allocated memory is still 148.9MB. Free memory was 107.6MB in the beginning and 103.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:16:27,042 INFO L158 Benchmark]: IcfgBuilder took 456.23ms. Allocated memory is still 148.9MB. Free memory was 103.5MB in the beginning and 78.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 03:16:27,043 INFO L158 Benchmark]: TraceAbstraction took 5275.98ms. Allocated memory was 148.9MB in the beginning and 230.7MB in the end (delta: 81.8MB). Free memory was 78.3MB in the beginning and 166.7MB in the end (delta: -88.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:16:27,043 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 230.7MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:16:27,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.32ms. Allocated memory is still 148.9MB. Free memory was 77.1MB in the beginning and 111.0MB in the end (delta: -34.0MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.76ms. Allocated memory is still 148.9MB. Free memory was 111.0MB in the beginning and 107.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.00ms. Allocated memory is still 148.9MB. Free memory was 107.6MB in the beginning and 103.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 456.23ms. Allocated memory is still 148.9MB. Free memory was 103.5MB in the beginning and 78.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5275.98ms. Allocated memory was 148.9MB in the beginning and 230.7MB in the end (delta: 81.8MB). Free memory was 78.3MB in the beginning and 166.7MB in the end (delta: -88.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 230.7MB. Free memory is still 166.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 157. Possible FailurePath: [L26] unsigned char isInitial = 0; [L27] unsigned char var_1_1 = 0; [L28] unsigned short int var_1_2 = 256; [L29] unsigned short int var_1_3 = 128; [L30] unsigned char var_1_4 = 0; [L31] unsigned char var_1_5 = 0; [L32] unsigned short int var_1_6 = 4; [L33] signed short int var_1_7 = 32; [L34] signed long int var_1_8 = 100000000; [L35] unsigned short int var_1_9 = 4; [L36] unsigned short int var_1_10 = 10; [L37] double var_1_11 = 15.6; [L38] double var_1_12 = 256.4; [L39] double var_1_13 = 49.15; [L40] unsigned long int var_1_14 = 500; [L41] unsigned long int var_1_15 = 2173307753; [L42] unsigned long int var_1_16 = 3362224480; [L43] signed short int var_1_17 = 16; [L44] unsigned short int var_1_18 = 16; [L45] signed short int var_1_19 = 16; [L46] signed short int var_1_20 = 4; [L47] signed short int var_1_21 = 0; [L48] signed short int var_1_22 = -25; VAL [isInitial=0, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_2=256, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] FCALL updateLastVariables() [L165] CALL updateVariables() [L107] var_1_2 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L108] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L109] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L109] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L110] var_1_3 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L111] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L112] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L112] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L114] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L115] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L116] var_1_5 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L117] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L118] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L119] var_1_7 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L120] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L121] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L122] var_1_8 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L123] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L124] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L124] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L125] var_1_10 = __VERIFIER_nondet_ushort() [L126] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L126] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L127] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L127] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L128] var_1_12 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L129] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L130] var_1_13 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L131] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L132] var_1_15 = __VERIFIER_nondet_ulong() [L133] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L133] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L134] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L135] var_1_16 = __VERIFIER_nondet_ulong() [L136] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L136] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L137] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L138] var_1_18 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L139] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_18 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L140] RET assume_abort_if_not(var_1_18 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L141] var_1_19 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L142] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L143] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L144] var_1_20 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L145] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L146] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L147] var_1_21 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L148] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L149] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L150] var_1_22 = __VERIFIER_nondet_short() [L151] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L151] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L152] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L165] RET updateVariables() [L166] CALL step() [L71] COND FALSE !(var_1_2 <= var_1_3) [L76] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L78] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L83] COND FALSE !(var_1_4 || var_1_1) [L86] CALL functionized2(var_1_10, var_1_3) [L56] COND TRUE var_1_7 >= functionized2_localFunctionVar1 [L57] var_1_9 = functionized2_localFunctionVar0 VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L86] RET functionized2(var_1_10, var_1_3) [L88] COND FALSE !(var_1_6 <= var_1_2) [L93] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=500, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L95] COND TRUE var_1_6 >= var_1_3 [L96] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-5368709123, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L98] var_1_1 && (functionized3(var_1_5, var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-5368709123, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L98] COND FALSE !(var_1_1 && (functionized3(var_1_5, var_1_13))) [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return ((((((var_1_2 <= var_1_3) ? (((- var_1_3) > var_1_2) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((var_1_2 * (var_1_3 + var_1_7)) > var_1_8) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_7 >= var_1_3) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_6 <= var_1_2) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((var_1_6 >= var_1_3) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - var_1_2))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (var_1_9 >= ((((var_1_18) > (var_1_7)) ? (var_1_18) : (var_1_7))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-5368709123, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-5368709123, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-5368709123, var_1_15=2147483647, var_1_16=-5368709122, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 1651 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1211 mSDsCounter, 296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 854 IncrementalHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 296 mSolverCounterUnsat, 440 mSDtfsCounter, 854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 634 GetRequests, 581 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=2, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 97 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 923 ConstructedInterpolants, 0 QuantifiedInterpolants, 2098 SizeOfPredicates, 4 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 8484/8700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:16:27,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.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 2179a43a83e486ac9d5e9c9fcb73d284bce02d99497a2b587e68e71bd6344001 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:16:28,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:16:28,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:16:28,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:16:28,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:16:28,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:16:28,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:16:28,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:16:28,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:16:29,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:16:29,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:16:29,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:16:29,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:16:29,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:16:29,002 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:16:29,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:16:29,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:16:29,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:16:29,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:16:29,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:16:29,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:16:29,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:16:29,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:16:29,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:16:29,008 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:16:29,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:16:29,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:16:29,009 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:16:29,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:16:29,009 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:16:29,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:16:29,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:16:29,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:16:29,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:16:29,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:16:29,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:16:29,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:16:29,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:16:29,011 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:16:29,011 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:16:29,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:16:29,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:16:29,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:16:29,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:16:29,014 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 -> 2179a43a83e486ac9d5e9c9fcb73d284bce02d99497a2b587e68e71bd6344001 [2024-11-10 03:16:29,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:16:29,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:16:29,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:16:29,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:16:29,291 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:16:29,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i [2024-11-10 03:16:30,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:16:30,801 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:16:30,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i [2024-11-10 03:16:30,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afedb6136/e7f832cd0ccb47bc977872647c39a843/FLAG715091d52 [2024-11-10 03:16:31,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afedb6136/e7f832cd0ccb47bc977872647c39a843 [2024-11-10 03:16:31,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:16:31,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:16:31,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:16:31,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:16:31,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:16:31,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a613dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31, skipping insertion in model container [2024-11-10 03:16:31,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:16:31,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i[919,932] [2024-11-10 03:16:31,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:16:31,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:16:31,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i[919,932] [2024-11-10 03:16:31,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:16:31,512 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:16:31,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31 WrapperNode [2024-11-10 03:16:31,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:16:31,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:16:31,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:16:31,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:16:31,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,569 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 190 [2024-11-10 03:16:31,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:16:31,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:16:31,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:16:31,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:16:31,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,599 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:16:31,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:16:31,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:16:31,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:16:31,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:16:31,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (1/1) ... [2024-11-10 03:16:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:16:31,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:16:31,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:16:31,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:16:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:16:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:16:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:16:31,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:16:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:16:31,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:16:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure functionized4 [2024-11-10 03:16:31,691 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized4 [2024-11-10 03:16:31,756 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:16:31,758 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:16:32,261 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-10 03:16:32,262 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:16:32,273 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:16:32,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:16:32,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:32 BoogieIcfgContainer [2024-11-10 03:16:32,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:16:32,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:16:32,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:16:32,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:16:32,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:16:31" (1/3) ... [2024-11-10 03:16:32,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d325054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:16:32, skipping insertion in model container [2024-11-10 03:16:32,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:31" (2/3) ... [2024-11-10 03:16:32,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d325054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:16:32, skipping insertion in model container [2024-11-10 03:16:32,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:32" (3/3) ... [2024-11-10 03:16:32,279 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-4.i [2024-11-10 03:16:32,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:16:32,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:16:32,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:16:32,345 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;@301a85f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:16:32,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:16:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 58 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 03:16:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 03:16:32,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:32,363 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:32,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:32,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 523115868, now seen corresponding path program 1 times [2024-11-10 03:16:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:32,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950301425] [2024-11-10 03:16:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:32,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:32,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:16:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:32,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:16:32,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:16:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2024-11-10 03:16:32,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:16:32,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:16:32,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950301425] [2024-11-10 03:16:32,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950301425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:16:32,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:16:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:16:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382045552] [2024-11-10 03:16:32,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:16:32,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:16:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:16:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:16:32,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:16:32,693 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 58 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:16:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:32,721 INFO L93 Difference]: Finished difference Result 178 states and 301 transitions. [2024-11-10 03:16:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:16:32,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 185 [2024-11-10 03:16:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:32,731 INFO L225 Difference]: With dead ends: 178 [2024-11-10 03:16:32,732 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 03:16:32,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:16:32,743 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:32,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:16:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 03:16:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 03:16:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 03:16:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2024-11-10 03:16:32,780 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 185 [2024-11-10 03:16:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:32,781 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2024-11-10 03:16:32,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:16:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2024-11-10 03:16:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 03:16:32,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:32,786 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:32,795 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:16:32,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:32,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:32,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1334871386, now seen corresponding path program 1 times [2024-11-10 03:16:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:32,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812026858] [2024-11-10 03:16:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:32,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:32,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:32,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:32,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:16:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:33,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 03:16:33,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:16:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 635 proven. 135 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-11-10 03:16:33,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:16:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 138 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-11-10 03:16:34,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:16:34,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812026858] [2024-11-10 03:16:34,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812026858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:16:34,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:16:34,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-10 03:16:34,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692349764] [2024-11-10 03:16:34,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:16:34,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 03:16:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:16:34,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 03:16:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:16:34,388 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-10 03:16:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:35,562 INFO L93 Difference]: Finished difference Result 223 states and 319 transitions. [2024-11-10 03:16:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 03:16:35,563 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 185 [2024-11-10 03:16:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:35,565 INFO L225 Difference]: With dead ends: 223 [2024-11-10 03:16:35,566 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 03:16:35,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2024-11-10 03:16:35,569 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 184 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:35,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 322 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 03:16:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 03:16:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2024-11-10 03:16:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 84 states have internal predecessors, (102), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 03:16:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2024-11-10 03:16:35,596 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 185 [2024-11-10 03:16:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:35,597 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2024-11-10 03:16:35,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-10 03:16:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2024-11-10 03:16:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 03:16:35,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:35,600 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:35,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:16:35,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:35,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:35,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -272636648, now seen corresponding path program 1 times [2024-11-10 03:16:35,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:35,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402075286] [2024-11-10 03:16:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:35,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:35,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:35,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:35,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:16:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:35,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 03:16:35,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:16:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-11-10 03:16:36,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:16:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:16:36,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:16:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402075286] [2024-11-10 03:16:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402075286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:16:36,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:16:36,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2024-11-10 03:16:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808161133] [2024-11-10 03:16:36,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:16:36,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:16:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:16:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:16:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:16:36,954 INFO L87 Difference]: Start difference. First operand 128 states and 178 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-11-10 03:16:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:37,646 INFO L93 Difference]: Finished difference Result 233 states and 320 transitions. [2024-11-10 03:16:37,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:16:37,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 187 [2024-11-10 03:16:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:37,648 INFO L225 Difference]: With dead ends: 233 [2024-11-10 03:16:37,648 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 03:16:37,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:16:37,649 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 112 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:37,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 187 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:16:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 03:16:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2024-11-10 03:16:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 03:16:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2024-11-10 03:16:37,664 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 187 [2024-11-10 03:16:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:37,665 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2024-11-10 03:16:37,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-11-10 03:16:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2024-11-10 03:16:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 03:16:37,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:37,669 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:37,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 03:16:37,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:37,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:37,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:37,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2025765315, now seen corresponding path program 1 times [2024-11-10 03:16:37,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:37,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521368563] [2024-11-10 03:16:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:37,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:37,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:37,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:37,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 03:16:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:38,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 03:16:38,043 INFO L278 TraceCheckSpWp]: Computing forward predicates...