./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_normal_file-89.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 533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:21:43,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:21:43,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:21:43,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:21:43,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:21:43,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:21:43,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:21:43,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:21:43,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:21:43,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:21:43,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:21:43,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:21:43,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:21:43,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:21:43,921 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:21:43,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:21:43,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:21:43,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:21:43,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:21:43,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:21:43,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:21:43,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:21:43,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:21:43,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:21:43,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:21:43,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:21:43,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:21:43,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:21:43,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:21:43,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:21:43,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:21:43,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:21:43,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:21:43,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:21:43,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:21:43,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:21:43,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:21:43,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:21:43,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:21:43,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:21:43,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:21:43,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:21:43,934 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 -> 533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7 [2024-11-16 12:21:44,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:21:44,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:21:44,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:21:44,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:21:44,160 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:21:44,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i [2024-11-16 12:21:45,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:21:45,694 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:21:45,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i [2024-11-16 12:21:45,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f42993b/a6b947d9acd640c7a6f689cef3525cad/FLAG73625c206 [2024-11-16 12:21:46,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f42993b/a6b947d9acd640c7a6f689cef3525cad [2024-11-16 12:21:46,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:21:46,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:21:46,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:21:46,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:21:46,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:21:46,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc9f4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46, skipping insertion in model container [2024-11-16 12:21:46,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:21:46,253 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_normal_file-89.i[913,926] [2024-11-16 12:21:46,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:21:46,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:21:46,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i[913,926] [2024-11-16 12:21:46,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:21:46,360 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:21:46,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46 WrapperNode [2024-11-16 12:21:46,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:21:46,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:21:46,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:21:46,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:21:46,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,422 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-11-16 12:21:46,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:21:46,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:21:46,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:21:46,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:21:46,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,447 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-16 12:21:46,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:21:46,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:21:46,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:21:46,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:21:46,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (1/1) ... [2024-11-16 12:21:46,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:21:46,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:21:46,510 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-16 12:21:46,519 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-16 12:21:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:21:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:21:46,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:21:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:21:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:21:46,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:21:46,629 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:21:46,631 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:21:46,959 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:21:46,959 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:21:46,979 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:21:46,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:21:46,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:21:46 BoogieIcfgContainer [2024-11-16 12:21:46,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:21:46,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:21:46,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:21:46,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:21:46,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:21:46" (1/3) ... [2024-11-16 12:21:46,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2e9610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:46, skipping insertion in model container [2024-11-16 12:21:46,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:46" (2/3) ... [2024-11-16 12:21:46,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2e9610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:46, skipping insertion in model container [2024-11-16 12:21:46,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:21:46" (3/3) ... [2024-11-16 12:21:46,990 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-89.i [2024-11-16 12:21:47,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:21:47,002 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:21:47,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:21:47,067 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;@1fcc6586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:21:47,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:21:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 12:21:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 12:21:47,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:21:47,093 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:21:47,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:21:47,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:21:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1974044793, now seen corresponding path program 1 times [2024-11-16 12:21:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:21:47,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55821950] [2024-11-16 12:21:47,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:21:47,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:21:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:21:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:21:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:21:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:21:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:21:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:21:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:21:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:21:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:21:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:21:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:21:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:21:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:21:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:21:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:21:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:21:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:21:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:21:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:21:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:21:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:21:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:21:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:21:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:21:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 12:21:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:21:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55821950] [2024-11-16 12:21:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55821950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:21:47,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:21:47,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:21:47,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145313491] [2024-11-16 12:21:47,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:21:47,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:21:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:21:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:21:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:21:47,504 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 12:21:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:21:47,526 INFO L93 Difference]: Finished difference Result 136 states and 239 transitions. [2024-11-16 12:21:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:21:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2024-11-16 12:21:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:21:47,535 INFO L225 Difference]: With dead ends: 136 [2024-11-16 12:21:47,536 INFO L226 Difference]: Without dead ends: 67 [2024-11-16 12:21:47,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-16 12:21:47,542 INFO L432 NwaCegarLoop]: 103 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, 103 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-16 12:21:47,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:21:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-16 12:21:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-16 12:21:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 12:21:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-11-16 12:21:47,584 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 150 [2024-11-16 12:21:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:21:47,585 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-11-16 12:21:47,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 12:21:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-11-16 12:21:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 12:21:47,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:21:47,588 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:21:47,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:21:47,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:21:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:21:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash 970818327, now seen corresponding path program 1 times [2024-11-16 12:21:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:21:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541841573] [2024-11-16 12:21:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:21:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:21:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:21:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:21:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:21:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:21:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:21:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:21:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:21:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:21:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:21:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:21:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:21:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:21:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:21:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:21:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:21:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:21:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:21:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:21:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:21:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:21:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:21:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:21:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:21:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:21:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 12:21:48,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:21:48,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541841573] [2024-11-16 12:21:48,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541841573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:21:48,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:21:48,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:21:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717044740] [2024-11-16 12:21:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:21:48,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:21:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:21:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:21:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:21:48,202 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 12:21:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:21:48,251 INFO L93 Difference]: Finished difference Result 194 states and 301 transitions. [2024-11-16 12:21:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:21:48,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-16 12:21:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:21:48,255 INFO L225 Difference]: With dead ends: 194 [2024-11-16 12:21:48,257 INFO L226 Difference]: Without dead ends: 130 [2024-11-16 12:21:48,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:21:48,258 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:21:48,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 195 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:21:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-16 12:21:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2024-11-16 12:21:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 12:21:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 194 transitions. [2024-11-16 12:21:48,295 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 194 transitions. Word has length 150 [2024-11-16 12:21:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:21:48,296 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 194 transitions. [2024-11-16 12:21:48,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 12:21:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 194 transitions. [2024-11-16 12:21:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 12:21:48,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:21:48,298 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:21:48,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:21:48,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:21:48,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:21:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash -693834953, now seen corresponding path program 1 times [2024-11-16 12:21:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:21:48,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444421977] [2024-11-16 12:21:48,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:21:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:21:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:21:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611813487] [2024-11-16 12:21:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:21:48,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:21:48,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:21:48,410 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-16 12:21:48,411 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-16 12:21:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:21:48,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:21:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:21:48,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:21:48,672 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:21:48,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:21:48,689 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-16 12:21:48,874 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-16 12:21:48,877 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 12:21:48,968 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:21:48,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:21:48 BoogieIcfgContainer [2024-11-16 12:21:48,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:21:48,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:21:48,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:21:48,971 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:21:48,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:21:46" (3/4) ... [2024-11-16 12:21:48,973 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:21:48,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:21:48,975 INFO L158 Benchmark]: Toolchain (without parser) took 2888.15ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 112.9MB in the beginning and 227.1MB in the end (delta: -114.3MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-16 12:21:48,975 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 127.9MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:21:48,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.44ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 97.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 12:21:48,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.68ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 94.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:21:48,975 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 89.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:21:48,976 INFO L158 Benchmark]: IcfgBuilder took 521.67ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 89.4MB in the beginning and 246.6MB in the end (delta: -157.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-11-16 12:21:48,976 INFO L158 Benchmark]: TraceAbstraction took 1989.08ms. Allocated memory is still 287.3MB. Free memory was 245.6MB in the beginning and 227.1MB in the end (delta: 18.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-16 12:21:48,976 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 287.3MB. Free memory is still 227.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:21:48,978 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.13ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 127.9MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.44ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 97.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.68ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 94.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 89.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 521.67ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 89.4MB in the beginning and 246.6MB in the end (delta: -157.2MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1989.08ms. Allocated memory is still 287.3MB. Free memory was 245.6MB in the beginning and 227.1MB in the end (delta: 18.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 287.3MB. Free memory is still 227.1MB. 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 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] signed long int var_1_2 = 16; [L24] signed long int var_1_3 = 4; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 256; [L28] signed long int var_1_7 = -1; [L29] unsigned short int var_1_8 = 32; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 5; [L32] unsigned short int var_1_11 = 128; [L33] unsigned char var_1_12 = 32; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_15 = 0; [L37] double var_1_16 = 63.75; [L38] double var_1_17 = 8.5; [L39] signed short int var_1_18 = -64; VAL [isInitial=0, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=16, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L96] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L97] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L97] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L98] var_1_3 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L99] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L100] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L100] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L103] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L103] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L104] var_1_5 = __VERIFIER_nondet_long() [L105] CALL assume_abort_if_not(var_1_5 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L105] RET assume_abort_if_not(var_1_5 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L106] CALL assume_abort_if_not(var_1_5 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L106] RET assume_abort_if_not(var_1_5 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L107] var_1_6 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_6 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L108] RET assume_abort_if_not(var_1_6 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L109] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L109] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L110] var_1_7 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_7 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L111] RET assume_abort_if_not(var_1_7 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L112] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L112] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L113] var_1_9 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L114] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L115] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L116] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L117] var_1_10 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L118] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L119] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L120] var_1_11 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L121] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L122] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L123] var_1_13 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L124] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L125] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L127] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L128] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L129] var_1_17 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L130] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L143] RET updateVariables() [L144] CALL step() [L43] COND FALSE !(var_1_2 != var_1_3) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L48] COND FALSE !(var_1_6 >= (var_1_5 / var_1_9)) [L55] var_1_8 = var_1_10 VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L57] COND FALSE !(var_1_10 < var_1_1) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L68] COND FALSE !(var_1_12 > (((((var_1_3) < (var_1_8)) ? (var_1_3) : (var_1_8))) + var_1_10)) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L79] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L86] COND TRUE \read(var_1_4) [L87] var_1_16 = 5.2 VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L92] var_1_18 = var_1_12 VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return ((((((var_1_2 != var_1_3) ? (var_1_4 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_5)) ? (-5) : (var_1_5)))) < (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) ? (((((-5) > (var_1_5)) ? (-5) : (var_1_5)))) : (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7)))))))) : 1) : 1) && ((var_1_6 >= (var_1_5 / var_1_9)) ? ((var_1_3 < (var_1_2 * 256)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) < (((((128) < (var_1_11)) ? (128) : (var_1_11))))) ? (var_1_10) : (((((128) < (var_1_11)) ? (128) : (var_1_11)))))))) : (var_1_8 == ((unsigned short int) var_1_11))) : (var_1_8 == ((unsigned short int) var_1_10)))) && ((var_1_10 < var_1_1) ? ((var_1_3 <= (5 - var_1_8)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((var_1_3 == var_1_6) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_12 > (((((var_1_3) < (var_1_8)) ? (var_1_3) : (var_1_8))) + var_1_10)) ? ((! (var_1_8 >= var_1_5)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_4 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_12)) ; VAL [\result=0, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 204 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2208/2208 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-16 12:21:49,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.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 533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:21:51,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:21:51,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:21:51,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:21:51,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:21:51,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:21:51,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:21:51,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:21:51,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:21:51,282 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:21:51,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:21:51,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:21:51,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:21:51,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:21:51,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:21:51,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:21:51,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:21:51,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:21:51,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:21:51,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:21:51,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:21:51,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:21:51,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:21:51,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:21:51,289 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:21:51,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:21:51,290 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:21:51,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:21:51,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:21:51,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:21:51,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:21:51,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:21:51,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:21:51,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:21:51,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:21:51,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:21:51,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:21:51,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:21:51,294 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:21:51,294 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:21:51,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:21:51,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:21:51,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:21:51,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:21:51,295 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 -> 533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7 [2024-11-16 12:21:51,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:21:51,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:21:51,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:21:51,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:21:51,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:21:51,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i [2024-11-16 12:21:53,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:21:53,409 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:21:53,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i [2024-11-16 12:21:53,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae200256/4c765776bd784626b857de0459c4c68a/FLAGcb44a9980 [2024-11-16 12:21:53,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae200256/4c765776bd784626b857de0459c4c68a [2024-11-16 12:21:53,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:21:53,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:21:53,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:21:53,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:21:53,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:21:53,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:53" (1/1) ... [2024-11-16 12:21:53,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5773583d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:53, skipping insertion in model container [2024-11-16 12:21:53,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:53" (1/1) ... [2024-11-16 12:21:53,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:21:53,965 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_normal_file-89.i[913,926] [2024-11-16 12:21:54,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:21:54,038 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:21:54,048 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_normal_file-89.i[913,926] [2024-11-16 12:21:54,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:21:54,096 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:21:54,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54 WrapperNode [2024-11-16 12:21:54,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:21:54,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:21:54,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:21:54,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:21:54,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,144 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-16 12:21:54,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:21:54,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:21:54,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:21:54,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:21:54,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,173 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-16 12:21:54,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:21:54,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:21:54,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:21:54,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:21:54,188 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (1/1) ... [2024-11-16 12:21:54,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:21:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:21:54,221 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-16 12:21:54,224 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-16 12:21:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:21:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:21:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:21:54,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:21:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:21:54,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:21:54,325 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:21:54,327 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:21:54,770 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:21:54,771 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:21:54,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:21:54,781 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:21:54,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:21:54 BoogieIcfgContainer [2024-11-16 12:21:54,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:21:54,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:21:54,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:21:54,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:21:54,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:21:53" (1/3) ... [2024-11-16 12:21:54,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca83bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:54, skipping insertion in model container [2024-11-16 12:21:54,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:54" (2/3) ... [2024-11-16 12:21:54,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca83bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:54, skipping insertion in model container [2024-11-16 12:21:54,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:21:54" (3/3) ... [2024-11-16 12:21:54,801 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-89.i [2024-11-16 12:21:54,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:21:54,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:21:54,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:21:54,877 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;@547edfd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:21:54,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:21:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 12:21:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 12:21:54,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:21:54,893 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:21:54,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:21:54,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:21:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1974044793, now seen corresponding path program 1 times [2024-11-16 12:21:54,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:21:54,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235800118] [2024-11-16 12:21:54,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:21:54,912 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-16 12:21:54,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:21:54,917 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-16 12:21:54,920 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-16 12:21:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:55,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:21:55,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:21:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2024-11-16 12:21:55,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:21:55,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:21:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235800118] [2024-11-16 12:21:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235800118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:21:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:21:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:21:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448368082] [2024-11-16 12:21:55,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:21:55,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:21:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:21:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:21:55,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:21:55,211 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 12:21:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:21:55,240 INFO L93 Difference]: Finished difference Result 136 states and 239 transitions. [2024-11-16 12:21:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:21:55,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2024-11-16 12:21:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:21:55,248 INFO L225 Difference]: With dead ends: 136 [2024-11-16 12:21:55,248 INFO L226 Difference]: Without dead ends: 67 [2024-11-16 12:21:55,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:21:55,254 INFO L432 NwaCegarLoop]: 103 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, 103 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-16 12:21:55,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:21:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-16 12:21:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-16 12:21:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 12:21:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-11-16 12:21:55,288 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 150 [2024-11-16 12:21:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:21:55,288 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-11-16 12:21:55,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 12:21:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-11-16 12:21:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 12:21:55,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:21:55,291 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:21:55,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:21:55,495 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-16 12:21:55,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:21:55,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:21:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 970818327, now seen corresponding path program 1 times [2024-11-16 12:21:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:21:55,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795707866] [2024-11-16 12:21:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:21:55,498 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-16 12:21:55,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:21:55,500 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-16 12:21:55,501 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-16 12:21:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:55,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 12:21:55,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:21:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 12:21:56,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:21:56,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:21:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795707866] [2024-11-16 12:21:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795707866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:21:56,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:21:56,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:21:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228373831] [2024-11-16 12:21:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:21:56,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:21:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:21:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:21:56,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:21:56,073 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 12:21:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:21:56,197 INFO L93 Difference]: Finished difference Result 193 states and 299 transitions. [2024-11-16 12:21:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:21:56,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-16 12:21:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:21:56,203 INFO L225 Difference]: With dead ends: 193 [2024-11-16 12:21:56,204 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 12:21:56,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:21:56,205 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 24 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:21:56,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 193 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:21:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 12:21:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2024-11-16 12:21:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 12:21:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 192 transitions. [2024-11-16 12:21:56,249 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 192 transitions. Word has length 150 [2024-11-16 12:21:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:21:56,252 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 192 transitions. [2024-11-16 12:21:56,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 12:21:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 192 transitions. [2024-11-16 12:21:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 12:21:56,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:21:56,253 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:21:56,273 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-16 12:21:56,454 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-16 12:21:56,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:21:56,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:21:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash -693834953, now seen corresponding path program 1 times [2024-11-16 12:21:56,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:21:56,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096968736] [2024-11-16 12:21:56,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:21:56,457 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-16 12:21:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:21:56,461 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-16 12:21:56,462 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-16 12:21:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:21:56,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 12:21:56,675 INFO L278 TraceCheckSpWp]: Computing forward predicates...