./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.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 e02387555c4e85b27c0d96305641a888bd9021ec1e0e518b9819057955f97970 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:25:21,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:25:21,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:25:21,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:25:21,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:25:21,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:25:21,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:25:21,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:25:21,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:25:21,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:25:21,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:25:21,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:25:21,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:25:21,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:25:21,945 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:25:21,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:25:21,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:25:21,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:25:21,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:25:21,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:25:21,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:25:21,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:25:21,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:25:21,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:25:21,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:25:21,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:25:21,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:25:21,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:25:21,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:25:21,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:25:21,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:25:21,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:25:21,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:25:21,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:25:21,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:25:21,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:25:21,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:25:21,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:25:21,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:25:21,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:25:21,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:25:21,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:25:21,959 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 -> e02387555c4e85b27c0d96305641a888bd9021ec1e0e518b9819057955f97970 [2024-11-10 03:25:22,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:25:22,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:25:22,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:25:22,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:25:22,229 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:25:22,230 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-78.i [2024-11-10 03:25:23,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:25:23,928 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:25:23,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.i [2024-11-10 03:25:23,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeccff891/ab2f67b09d5e4d52a8852ada50a60bf5/FLAG2615aebfb [2024-11-10 03:25:23,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeccff891/ab2f67b09d5e4d52a8852ada50a60bf5 [2024-11-10 03:25:23,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:25:23,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:25:23,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:25:23,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:25:23,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:25:23,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:25:23" (1/1) ... [2024-11-10 03:25:23,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216823e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:23, skipping insertion in model container [2024-11-10 03:25:23,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:25:23" (1/1) ... [2024-11-10 03:25:24,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:25:24,185 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-78.i[913,926] [2024-11-10 03:25:24,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:25:24,292 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:25:24,304 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-78.i[913,926] [2024-11-10 03:25:24,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:25:24,373 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:25:24,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24 WrapperNode [2024-11-10 03:25:24,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:25:24,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:25:24,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:25:24,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:25:24,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,455 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-10 03:25:24,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:25:24,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:25:24,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:25:24,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:25:24,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,514 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:25:24,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:25:24,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:25:24,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:25:24,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:25:24,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (1/1) ... [2024-11-10 03:25:24,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:25:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:25:24,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:25:24,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:25:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:25:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:25:24,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:25:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:25:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:25:24,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:25:24,764 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:25:24,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:25:25,282 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc property_#t~bitwise19#1;havoc property_#t~short20#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2024-11-10 03:25:25,323 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 03:25:25,324 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:25:25,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:25:25,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:25:25,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:25:25 BoogieIcfgContainer [2024-11-10 03:25:25,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:25:25,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:25:25,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:25:25,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:25:25,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:25:23" (1/3) ... [2024-11-10 03:25:25,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bb8146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:25:25, skipping insertion in model container [2024-11-10 03:25:25,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:24" (2/3) ... [2024-11-10 03:25:25,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bb8146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:25:25, skipping insertion in model container [2024-11-10 03:25:25,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:25:25" (3/3) ... [2024-11-10 03:25:25,359 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-78.i [2024-11-10 03:25:25,377 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:25:25,378 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:25:25,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:25:25,458 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;@33469623, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:25:25,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:25:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:25:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 03:25:25,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:25:25,481 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:25:25,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:25:25,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:25:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash -782632801, now seen corresponding path program 1 times [2024-11-10 03:25:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:25:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269738199] [2024-11-10 03:25:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:25:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:25:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:25:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:25:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:25:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:25:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:25:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:25:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:25:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:25:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:25:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:25:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:25:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:25:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:25:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:25:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:25:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:25:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:25:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:25:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:25:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:25:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:25:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:25:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:25:25,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269738199] [2024-11-10 03:25:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269738199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:25:25,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:25:25,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:25:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234052002] [2024-11-10 03:25:25,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:25:25,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:25:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:25:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:25:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:25:25,945 INFO L87 Difference]: Start difference. First operand has 85 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 03:25:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:25:25,992 INFO L93 Difference]: Finished difference Result 162 states and 271 transitions. [2024-11-10 03:25:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:25:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2024-11-10 03:25:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:25:26,004 INFO L225 Difference]: With dead ends: 162 [2024-11-10 03:25:26,004 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 03:25:26,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:25:26,013 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:25:26,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:25:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 03:25:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-10 03:25:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:25:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-10 03:25:26,060 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 146 [2024-11-10 03:25:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:25:26,060 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-10 03:25:26,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 03:25:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-10 03:25:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 03:25:26,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:25:26,065 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:25:26,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:25:26,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:25:26,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:25:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1018962727, now seen corresponding path program 1 times [2024-11-10 03:25:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:25:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700320672] [2024-11-10 03:25:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:25:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:25:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:25:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:25:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:25:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:25:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:25:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:25:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:25:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:25:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:25:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:25:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:25:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:25:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:25:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:25:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:25:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:25:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:25:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:25:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:25:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:25:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:25:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:25:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:25:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700320672] [2024-11-10 03:25:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700320672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:25:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:25:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:25:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234493803] [2024-11-10 03:25:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:25:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:25:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:25:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:25:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:25:26,628 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:25:26,808 INFO L93 Difference]: Finished difference Result 195 states and 293 transitions. [2024-11-10 03:25:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:25:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-10 03:25:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:25:26,814 INFO L225 Difference]: With dead ends: 195 [2024-11-10 03:25:26,818 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 03:25:26,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:25:26,820 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 100 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:25:26,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 262 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:25:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 03:25:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2024-11-10 03:25:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:25:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2024-11-10 03:25:26,841 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 146 [2024-11-10 03:25:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:25:26,842 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2024-11-10 03:25:26,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2024-11-10 03:25:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 03:25:26,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:25:26,846 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:25:26,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:25:26,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:25:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:25:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash 334346970, now seen corresponding path program 1 times [2024-11-10 03:25:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:25:26,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064657819] [2024-11-10 03:25:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:25:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:25:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:25:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:25:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:25:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:25:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:25:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:25:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:25:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:25:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:25:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:25:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:25:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:25:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:25:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:25:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:25:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:25:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:25:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:25:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:25:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:25:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:25:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:25:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:25:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064657819] [2024-11-10 03:25:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064657819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:25:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:25:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:25:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923167170] [2024-11-10 03:25:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:25:27,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:25:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:25:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:25:27,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:25:27,366 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:25:27,496 INFO L93 Difference]: Finished difference Result 193 states and 294 transitions. [2024-11-10 03:25:27,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:25:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-10 03:25:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:25:27,498 INFO L225 Difference]: With dead ends: 193 [2024-11-10 03:25:27,499 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 03:25:27,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:25:27,500 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:25:27,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 289 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:25:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 03:25:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-10 03:25:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:25:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-11-10 03:25:27,512 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 146 [2024-11-10 03:25:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:25:27,512 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-11-10 03:25:27,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-11-10 03:25:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 03:25:27,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:25:27,515 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:25:27,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:25:27,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:25:27,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:25:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash -114522596, now seen corresponding path program 1 times [2024-11-10 03:25:27,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:25:27,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080521165] [2024-11-10 03:25:27,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:27,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:25:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:25:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:25:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:25:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:25:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:25:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:25:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:25:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:25:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:25:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:25:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:25:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:25:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:25:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:25:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:25:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:25:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:25:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:25:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:25:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:25:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 03:25:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:25:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:25:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:25:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080521165] [2024-11-10 03:25:27,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080521165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:25:27,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:25:27,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:25:27,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499081559] [2024-11-10 03:25:27,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:25:27,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:25:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:25:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:25:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:25:27,701 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:25:27,818 INFO L93 Difference]: Finished difference Result 191 states and 286 transitions. [2024-11-10 03:25:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:25:27,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-10 03:25:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:25:27,822 INFO L225 Difference]: With dead ends: 191 [2024-11-10 03:25:27,823 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 03:25:27,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:25:27,828 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 54 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:25:27,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 236 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:25:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 03:25:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-10 03:25:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:25:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2024-11-10 03:25:27,847 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 148 [2024-11-10 03:25:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:25:27,848 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2024-11-10 03:25:27,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2024-11-10 03:25:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 03:25:27,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:25:27,850 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:25:27,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:25:27,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:25:27,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:25:27,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1727816250, now seen corresponding path program 1 times [2024-11-10 03:25:27,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:25:27,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134437654] [2024-11-10 03:25:27,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:27,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:25:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:25:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185449060] [2024-11-10 03:25:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:27,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:25:27,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:25:28,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:25:28,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:25:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:25:28,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:25:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:25:28,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:25:28,277 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:25:28,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:25:28,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:25:28,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:25:28,489 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 03:25:28,601 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:25:28,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:25:28 BoogieIcfgContainer [2024-11-10 03:25:28,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:25:28,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:25:28,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:25:28,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:25:28,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:25:25" (3/4) ... [2024-11-10 03:25:28,608 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:25:28,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:25:28,611 INFO L158 Benchmark]: Toolchain (without parser) took 4647.54ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 103.2MB in the beginning and 171.2MB in the end (delta: -68.0MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-11-10 03:25:28,611 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 118.7MB in the beginning and 118.4MB in the end (delta: 260.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:25:28,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.50ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 86.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:25:28,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.05ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 79.8MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 03:25:28,612 INFO L158 Benchmark]: Boogie Preprocessor took 90.22ms. Allocated memory is still 159.4MB. Free memory was 79.8MB in the beginning and 68.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 03:25:28,612 INFO L158 Benchmark]: IcfgBuilder took 803.22ms. Allocated memory is still 159.4MB. Free memory was 68.8MB in the beginning and 96.5MB in the end (delta: -27.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-10 03:25:28,613 INFO L158 Benchmark]: TraceAbstraction took 3252.43ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 95.7MB in the beginning and 172.2MB in the end (delta: -76.5MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-10 03:25:28,613 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 247.5MB. Free memory was 172.2MB in the beginning and 171.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:25:28,619 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.19ms. Allocated memory is still 159.4MB. Free memory was 118.7MB in the beginning and 118.4MB in the end (delta: 260.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.50ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 86.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.05ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 79.8MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.22ms. Allocated memory is still 159.4MB. Free memory was 79.8MB in the beginning and 68.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 803.22ms. Allocated memory is still 159.4MB. Free memory was 68.8MB in the beginning and 96.5MB in the end (delta: -27.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3252.43ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 95.7MB in the beginning and 172.2MB in the end (delta: -76.5MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 247.5MB. Free memory was 172.2MB in the beginning and 171.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. 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 113, overapproximation of someBinaryArithmeticDOUBLEoperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] signed long int var_1_2 = 0; [L24] unsigned char var_1_3 = 64; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 2; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 8; [L29] double var_1_8 = 1.875; [L30] signed long int var_1_9 = -4; [L31] double var_1_10 = 63.5; [L32] double var_1_11 = 255.375; [L33] double var_1_12 = 999999999.525; [L34] double var_1_13 = 63.75; [L35] double var_1_14 = 0.625; [L36] unsigned short int var_1_15 = 5; [L37] signed char var_1_16 = 4; [L38] signed char var_1_17 = 0; [L39] signed char var_1_18 = -2; [L40] signed char var_1_19 = 1; [L41] unsigned short int var_1_20 = 50; [L42] unsigned short int var_1_21 = 0; VAL [isInitial=0, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] FCALL updateLastVariables() [L121] CALL updateVariables() [L74] var_1_2 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_2 >= -2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L75] RET assume_abort_if_not(var_1_2 >= -2147483646) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L76] CALL assume_abort_if_not(var_1_2 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L76] RET assume_abort_if_not(var_1_2 <= 2147483646) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L77] var_1_4 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L79] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L79] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L80] var_1_5 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L82] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=8, var_1_8=15/8, var_1_9=-4] [L83] var_1_7 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=-4] [L86] var_1_9 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L87] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L88] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L88] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L89] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L89] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L90] var_1_10 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L91] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L92] var_1_11 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L93] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L94] var_1_12 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L95] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L96] var_1_13 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L97] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L98] var_1_14 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L99] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L100] var_1_17 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L101] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L102] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L102] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L103] var_1_18 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L104] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L105] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L105] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L106] var_1_19 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L107] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L108] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L108] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L121] RET updateVariables() [L122] CALL step() [L46] var_1_1 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L47] COND FALSE !(var_1_1 < var_1_2) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L50] EXPR var_1_2 ^ var_1_1 VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=10, var_1_7=0, var_1_8=15/8, var_1_9=33] [L50] COND FALSE !((var_1_2 ^ var_1_1) < -256) [L53] COND TRUE var_1_5 <= 50 [L54] var_1_6 = var_1_3 VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_8=15/8, var_1_9=33] [L57] COND TRUE var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L58] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, var_1_15=5, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L64] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1 [L65] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, var_1_15=288, var_1_16=4, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=50, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L67] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L68] var_1_20 = (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4))) VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L69] EXPR (var_1_2 * var_1_17) & (var_1_15 * var_1_18) VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=0, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L69] COND TRUE var_1_16 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18)) [L70] var_1_21 = (var_1_4 + 128) VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=382, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR ((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1)) VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=382, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L113] EXPR var_1_2 ^ var_1_1 VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=382, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L113] EXPR ((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1)) VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=382, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L113] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1))) && ((var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4)))))) && ((var_1_16 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=382, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L113-L114] return (((((((var_1_1 == ((signed long int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) && ((var_1_1 < var_1_2) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((var_1_2 ^ var_1_1) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((var_1_3 + var_1_7))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((var_1_3 + var_1_7)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) var_1_3)) : 1))) && ((var_1_1 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_1) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_3)) > (var_1_4)) ? ((var_1_5 + var_1_3)) : (var_1_4)))))) && ((var_1_16 == ((var_1_2 * var_1_17) & (var_1_15 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=382, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] [L19] reach_error() VAL [isInitial=1, var_1_15=288, var_1_16=0, var_1_17=-33, var_1_18=32, var_1_19=1, var_1_1=0, var_1_20=254, var_1_21=382, var_1_2=0, var_1_3=64, var_1_4=254, var_1_5=34, var_1_6=64, var_1_7=0, var_1_9=33] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 903 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 246 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 410 mSDtfsCounter, 246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 884 NumberOfCodeBlocks, 884 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 582 ConstructedInterpolants, 0 QuantifiedInterpolants, 826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3696/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:25:28,654 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-78.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 e02387555c4e85b27c0d96305641a888bd9021ec1e0e518b9819057955f97970 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:25:30,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:25:30,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:25:30,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:25:30,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:25:31,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:25:31,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:25:31,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:25:31,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:25:31,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:25:31,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:25:31,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:25:31,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:25:31,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:25:31,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:25:31,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:25:31,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:25:31,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:25:31,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:25:31,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:25:31,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:25:31,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:25:31,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:25:31,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:25:31,012 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:25:31,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:25:31,013 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:25:31,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:25:31,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:25:31,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:25:31,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:25:31,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:25:31,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:25:31,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:25:31,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:25:31,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:25:31,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:25:31,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:25:31,022 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:25:31,024 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:25:31,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:25:31,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:25:31,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:25:31,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:25:31,025 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 -> e02387555c4e85b27c0d96305641a888bd9021ec1e0e518b9819057955f97970 [2024-11-10 03:25:31,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:25:31,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:25:31,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:25:31,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:25:31,342 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:25:31,343 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-78.i [2024-11-10 03:25:33,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:25:33,291 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:25:33,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-78.i [2024-11-10 03:25:33,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325d61cae/0c4e3cc79e8e49619510e2b08f58b2a4/FLAGb2d6c0d31 [2024-11-10 03:25:33,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325d61cae/0c4e3cc79e8e49619510e2b08f58b2a4 [2024-11-10 03:25:33,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:25:33,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:25:33,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:25:33,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:25:33,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:25:33,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210a8a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33, skipping insertion in model container [2024-11-10 03:25:33,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:25:33,547 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-78.i[913,926] [2024-11-10 03:25:33,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:25:33,664 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:25:33,676 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-78.i[913,926] [2024-11-10 03:25:33,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:25:33,720 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:25:33,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33 WrapperNode [2024-11-10 03:25:33,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:25:33,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:25:33,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:25:33,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:25:33,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,780 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-10 03:25:33,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:25:33,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:25:33,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:25:33,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:25:33,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,823 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:25:33,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:25:33,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:25:33,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:25:33,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:25:33,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (1/1) ... [2024-11-10 03:25:33,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:25:33,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:25:33,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:25:33,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:25:33,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:25:33,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:25:33,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:25:33,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:25:33,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:25:33,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:25:34,005 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:25:34,009 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:25:40,044 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:25:40,044 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:25:40,062 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:25:40,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:25:40,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:25:40 BoogieIcfgContainer [2024-11-10 03:25:40,063 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:25:40,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:25:40,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:25:40,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:25:40,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:25:33" (1/3) ... [2024-11-10 03:25:40,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd6cf80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:25:40, skipping insertion in model container [2024-11-10 03:25:40,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:25:33" (2/3) ... [2024-11-10 03:25:40,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd6cf80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:25:40, skipping insertion in model container [2024-11-10 03:25:40,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:25:40" (3/3) ... [2024-11-10 03:25:40,072 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-78.i [2024-11-10 03:25:40,091 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:25:40,091 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:25:40,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:25:40,169 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;@1a5d10a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:25:40,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:25:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:25:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 03:25:40,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:25:40,189 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:25:40,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:25:40,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:25:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2058288998, now seen corresponding path program 1 times [2024-11-10 03:25:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:25:40,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279531898] [2024-11-10 03:25:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:40,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:25:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:25:40,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:25:40,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:25:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:40,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:25:40,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:25:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-11-10 03:25:40,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:25:40,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:25:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279531898] [2024-11-10 03:25:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279531898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:25:40,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:25:40,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:25:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559536497] [2024-11-10 03:25:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:25:40,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:25:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:25:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:25:40,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:25:40,732 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 03:25:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:25:40,768 INFO L93 Difference]: Finished difference Result 122 states and 207 transitions. [2024-11-10 03:25:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:25:40,770 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2024-11-10 03:25:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:25:40,776 INFO L225 Difference]: With dead ends: 122 [2024-11-10 03:25:40,776 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 03:25:40,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:25:40,783 INFO L432 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:25:40,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:25:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 03:25:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-10 03:25:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:25:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2024-11-10 03:25:40,826 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 140 [2024-11-10 03:25:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:25:40,826 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2024-11-10 03:25:40,827 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 03:25:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2024-11-10 03:25:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 03:25:40,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:25:40,830 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:25:40,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 03:25:41,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:25:41,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:25:41,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:25:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash 346101844, now seen corresponding path program 1 times [2024-11-10 03:25:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:25:41,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553534326] [2024-11-10 03:25:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:41,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:25:41,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:25:41,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:25:41,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:25:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:41,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 03:25:41,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:25:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:25:41,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:25:41,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:25:41,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553534326] [2024-11-10 03:25:41,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553534326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:25:41,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:25:41,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:25:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006513259] [2024-11-10 03:25:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:25:41,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:25:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:25:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:25:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:25:41,658 INFO L87 Difference]: Start difference. First operand 60 states and 88 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:44,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:25:47,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:25:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:25:47,190 INFO L93 Difference]: Finished difference Result 120 states and 176 transitions. [2024-11-10 03:25:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:25:47,192 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-11-10 03:25:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:25:47,194 INFO L225 Difference]: With dead ends: 120 [2024-11-10 03:25:47,194 INFO L226 Difference]: Without dead ends: 63 [2024-11-10 03:25:47,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:25:47,196 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 23 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:25:47,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-10 03:25:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-10 03:25:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2024-11-10 03:25:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:25:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-11-10 03:25:47,208 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 140 [2024-11-10 03:25:47,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:25:47,210 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-11-10 03:25:47,210 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-10 03:25:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 03:25:47,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:25:47,213 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:25:47,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:25:47,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:25:47,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:25:47,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:25:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1450849515, now seen corresponding path program 1 times [2024-11-10 03:25:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:25:47,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005934274] [2024-11-10 03:25:47,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:25:47,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:25:47,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:25:47,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:25:47,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:25:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:25:47,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 03:25:47,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:25:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 03:25:48,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:25:48,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:25:48,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005934274] [2024-11-10 03:25:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005934274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:25:48,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:25:48,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:25:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345350440] [2024-11-10 03:25:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:25:48,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:25:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:25:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:25:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:25:48,299 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:25:50,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:25:55,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 03:25:59,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:26:01,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 03:26:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:26:02,248 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2024-11-10 03:26:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:26:02,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-11-10 03:26:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:26:02,252 INFO L225 Difference]: With dead ends: 174 [2024-11-10 03:26:02,252 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 03:26:02,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:26:02,254 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 114 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:26:02,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 294 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 13.8s Time] [2024-11-10 03:26:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 03:26:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 63. [2024-11-10 03:26:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:26:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-11-10 03:26:02,275 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 140 [2024-11-10 03:26:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:26:02,277 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-11-10 03:26:02,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 03:26:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-11-10 03:26:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 03:26:02,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:02,281 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:02,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 03:26:02,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:26:02,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:02,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1547566193, now seen corresponding path program 1 times [2024-11-10 03:26:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:26:02,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400170827] [2024-11-10 03:26:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:26:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:26:02,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:26:02,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 03:26:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:02,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 03:26:02,900 INFO L278 TraceCheckSpWp]: Computing forward predicates...