./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.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 8c062e0b52e5b782e5946e5616c1aea186202785894035b8b4bb967c003e9581 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:50:22,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:50:22,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:50:22,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:50:22,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:50:22,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:50:22,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:50:22,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:50:22,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:50:22,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:50:22,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:50:22,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:50:22,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:50:22,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:50:22,934 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:50:22,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:50:22,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:50:22,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:50:22,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:50:22,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:50:22,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:50:22,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:50:22,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:50:22,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:50:22,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:50:22,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:50:22,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:50:22,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:50:22,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:50:22,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:50:22,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:50:22,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:50:22,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:50:22,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:50:22,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:50:22,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:50:22,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:50:22,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:50:22,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:50:22,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:50:22,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:50:22,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:50:22,949 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 -> 8c062e0b52e5b782e5946e5616c1aea186202785894035b8b4bb967c003e9581 [2024-10-13 00:50:23,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:50:23,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:50:23,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:50:23,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:50:23,218 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:50:23,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-10-13 00:50:24,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:50:24,895 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:50:24,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-10-13 00:50:24,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e05640c/5f97fa5974d24475aa2ccaa4daafc1a7/FLAG8214191f4 [2024-10-13 00:50:24,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85e05640c/5f97fa5974d24475aa2ccaa4daafc1a7 [2024-10-13 00:50:24,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:50:24,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:50:24,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:50:24,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:50:24,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:50:24,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:50:24" (1/1) ... [2024-10-13 00:50:24,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c73f9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:24, skipping insertion in model container [2024-10-13 00:50:24,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:50:24" (1/1) ... [2024-10-13 00:50:24,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:50:25,115 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i[915,928] [2024-10-13 00:50:25,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:50:25,191 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:50:25,203 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i[915,928] [2024-10-13 00:50:25,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:50:25,268 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:50:25,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25 WrapperNode [2024-10-13 00:50:25,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:50:25,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:50:25,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:50:25,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:50:25,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,368 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-10-13 00:50:25,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:50:25,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:50:25,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:50:25,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:50:25,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,407 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:50:25,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:50:25,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:50:25,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:50:25,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:50:25,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (1/1) ... [2024-10-13 00:50:25,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:50:25,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:50:25,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:50:25,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:50:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:50:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:50:25,526 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:50:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:50:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:50:25,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:50:25,600 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:50:25,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:50:25,961 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 00:50:25,962 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:50:26,004 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:50:26,005 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:50:26,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:50:26 BoogieIcfgContainer [2024-10-13 00:50:26,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:50:26,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:50:26,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:50:26,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:50:26,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:50:24" (1/3) ... [2024-10-13 00:50:26,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e794ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:50:26, skipping insertion in model container [2024-10-13 00:50:26,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:25" (2/3) ... [2024-10-13 00:50:26,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e794ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:50:26, skipping insertion in model container [2024-10-13 00:50:26,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:50:26" (3/3) ... [2024-10-13 00:50:26,016 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-10-13 00:50:26,034 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:50:26,035 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:50:26,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:50:26,118 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;@26887149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:50:26,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:50:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:50:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 00:50:26,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:26,141 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:26,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:26,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2006507704, now seen corresponding path program 1 times [2024-10-13 00:50:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:26,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026717979] [2024-10-13 00:50:26,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:50:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:50:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:50:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:50:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:50:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 00:50:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 00:50:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 00:50:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:50:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 00:50:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:50:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:50:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:50:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:50:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:50:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:50:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:50:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:50:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:50:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:50:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:50:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:50:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:50:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:50:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:50:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:50:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026717979] [2024-10-13 00:50:26,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026717979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:26,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:50:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565222044] [2024-10-13 00:50:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:26,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:50:26,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:50:26,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:50:26,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:50:26,750 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:50:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:26,803 INFO L93 Difference]: Finished difference Result 129 states and 230 transitions. [2024-10-13 00:50:26,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:50:26,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 149 [2024-10-13 00:50:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:26,819 INFO L225 Difference]: With dead ends: 129 [2024-10-13 00:50:26,819 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 00:50:26,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:50:26,830 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:26,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:50:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 00:50:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 00:50:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:50:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2024-10-13 00:50:26,878 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 149 [2024-10-13 00:50:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:26,879 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2024-10-13 00:50:26,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:50:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2024-10-13 00:50:26,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 00:50:26,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:26,885 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:26,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:50:26,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:26,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash -743930056, now seen corresponding path program 1 times [2024-10-13 00:50:26,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:26,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078172862] [2024-10-13 00:50:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:26,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:50:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:50:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:50:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:50:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:50:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 00:50:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 00:50:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 00:50:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:50:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 00:50:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:50:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:50:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:50:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:50:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:50:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:50:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:50:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:50:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:50:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:50:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:50:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:50:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:50:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:50:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:50:27,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:50:27,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078172862] [2024-10-13 00:50:27,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078172862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:27,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:27,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 00:50:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365015108] [2024-10-13 00:50:27,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:27,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:50:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:50:27,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:50:27,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:50:27,540 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:50:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:27,883 INFO L93 Difference]: Finished difference Result 196 states and 301 transitions. [2024-10-13 00:50:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:50:27,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 149 [2024-10-13 00:50:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:27,889 INFO L225 Difference]: With dead ends: 196 [2024-10-13 00:50:27,891 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 00:50:27,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:50:27,893 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 135 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:27,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 400 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:50:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 00:50:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2024-10-13 00:50:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 00:50:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 193 transitions. [2024-10-13 00:50:27,944 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 193 transitions. Word has length 149 [2024-10-13 00:50:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:27,945 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 193 transitions. [2024-10-13 00:50:27,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:50:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 193 transitions. [2024-10-13 00:50:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 00:50:27,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:27,948 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:27,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:50:27,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:27,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash -743870474, now seen corresponding path program 1 times [2024-10-13 00:50:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373170530] [2024-10-13 00:50:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:50:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:50:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:50:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:50:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:50:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 00:50:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 00:50:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 00:50:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:50:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 00:50:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:50:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:50:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:50:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:50:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:50:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:50:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:50:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:50:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:50:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:50:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:50:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:50:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:50:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:50:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:50:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:50:28,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373170530] [2024-10-13 00:50:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373170530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:28,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:50:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360085381] [2024-10-13 00:50:28,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:28,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:50:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:50:28,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:50:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:50:28,184 INFO L87 Difference]: Start difference. First operand 124 states and 193 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:50:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:28,225 INFO L93 Difference]: Finished difference Result 242 states and 378 transitions. [2024-10-13 00:50:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:50:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 149 [2024-10-13 00:50:28,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:28,229 INFO L225 Difference]: With dead ends: 242 [2024-10-13 00:50:28,229 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 00:50:28,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:50:28,232 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:28,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:50:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 00:50:28,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 63. [2024-10-13 00:50:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:50:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-13 00:50:28,245 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 149 [2024-10-13 00:50:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:28,245 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-13 00:50:28,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:50:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-13 00:50:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 00:50:28,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:28,248 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:28,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:50:28,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:28,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:28,249 INFO L85 PathProgramCache]: Analyzing trace with hash -736303560, now seen corresponding path program 1 times [2024-10-13 00:50:28,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:28,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226068965] [2024-10-13 00:50:28,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:50:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845644342] [2024-10-13 00:50:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:28,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:50:28,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:50:28,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:50:28,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:50:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:50:28,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:50:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:50:28,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:50:28,779 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:50:28,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:50:28,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 00:50:28,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:50:28,987 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 00:50:29,097 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:50:29,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:50:29 BoogieIcfgContainer [2024-10-13 00:50:29,100 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:50:29,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:50:29,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:50:29,100 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:50:29,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:50:26" (3/4) ... [2024-10-13 00:50:29,102 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:50:29,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:50:29,103 INFO L158 Benchmark]: Toolchain (without parser) took 4177.78ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 79.7MB in the beginning and 120.7MB in the end (delta: -41.0MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-13 00:50:29,104 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:50:29,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.71ms. Allocated memory is still 134.2MB. Free memory was 79.4MB in the beginning and 106.1MB in the end (delta: -26.7MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-10-13 00:50:29,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.47ms. Allocated memory is still 134.2MB. Free memory was 106.1MB in the beginning and 102.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:50:29,104 INFO L158 Benchmark]: Boogie Preprocessor took 67.87ms. Allocated memory is still 134.2MB. Free memory was 102.0MB in the beginning and 97.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:50:29,105 INFO L158 Benchmark]: RCFGBuilder took 567.21ms. Allocated memory is still 134.2MB. Free memory was 97.2MB in the beginning and 69.3MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 00:50:29,105 INFO L158 Benchmark]: TraceAbstraction took 3092.06ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 68.4MB in the beginning and 121.8MB in the end (delta: -53.4MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-10-13 00:50:29,105 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 195.0MB. Free memory was 121.8MB in the beginning and 120.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:50:29,107 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 134.2MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.71ms. Allocated memory is still 134.2MB. Free memory was 79.4MB in the beginning and 106.1MB in the end (delta: -26.7MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.47ms. Allocated memory is still 134.2MB. Free memory was 106.1MB in the beginning and 102.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.87ms. Allocated memory is still 134.2MB. Free memory was 102.0MB in the beginning and 97.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 567.21ms. Allocated memory is still 134.2MB. Free memory was 97.2MB in the beginning and 69.3MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3092.06ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 68.4MB in the beginning and 121.8MB in the end (delta: -53.4MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 195.0MB. Free memory was 121.8MB in the beginning and 120.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] float var_1_6 = 255.25; [L27] unsigned short int var_1_7 = 16; [L28] signed char var_1_8 = -10; [L29] signed char var_1_9 = -8; [L30] unsigned short int var_1_10 = 8; [L31] unsigned short int var_1_11 = 10000; [L32] unsigned short int var_1_12 = 5; [L33] signed short int var_1_13 = 200; [L34] unsigned char var_1_15 = 0; [L35] unsigned short int var_1_16 = 35895; [L36] unsigned short int var_1_17 = 18336; [L37] unsigned char var_1_18 = 0; [L38] signed long int var_1_19 = -50; [L39] unsigned char var_1_20 = 10; [L40] unsigned char var_1_21 = 32; [L41] float var_1_22 = 255.2; [L42] float var_1_23 = 32.4; [L43] float var_1_24 = 3.25; [L44] signed char var_1_25 = 25; [L45] signed char var_1_26 = 25; [L46] signed char var_1_27 = -50; [L47] unsigned short int var_1_28 = 8; [L48] signed char last_1_var_1_8 = -10; [L49] unsigned char last_1_var_1_15 = 0; [L50] signed long int last_1_var_1_19 = -50; [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] CALL updateLastVariables() [L151] last_1_var_1_8 = var_1_8 [L152] last_1_var_1_15 = var_1_15 [L153] last_1_var_1_19 = var_1_19 [L163] RET updateLastVariables() [L164] CALL updateVariables() [L111] var_1_2 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L112] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L113] var_1_3 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L114] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L115] var_1_4 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L116] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L117] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L117] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L118] var_1_6 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L119] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L120] var_1_7 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_8=-10, var_1_9=-8] [L121] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_8=-10, var_1_9=-8] [L122] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=-8] [L122] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=-8] [L123] var_1_9 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L124] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L125] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L126] var_1_11 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L127] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L129] var_1_12 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L130] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L131] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L132] var_1_16 = __VERIFIER_nondet_ushort() [L133] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L133] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L134] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L135] var_1_17 = __VERIFIER_nondet_ushort() [L136] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L136] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L137] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L138] var_1_18 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L139] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L140] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=32, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L141] var_1_21 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L143] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L143] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_23=162/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L144] var_1_23 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L145] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=25, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L146] var_1_26 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L147] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L148] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_21=0, var_1_22=1276/5, var_1_24=13/4, var_1_25=25, var_1_26=0, var_1_27=-50, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L164] RET updateVariables() [L165] CALL step() [L54] var_1_20 = var_1_21 [L55] var_1_22 = var_1_23 [L56] var_1_24 = var_1_23 [L57] var_1_25 = var_1_26 [L58] var_1_27 = var_1_26 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L59] COND FALSE !(var_1_27 > var_1_20) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L64] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_0=1, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L65] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L72] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L74] COND TRUE (- var_1_7) < (var_1_1 * var_1_4) [L75] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L77] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L84] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=13345, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L85] COND FALSE !(var_1_3 != var_1_6) [L92] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=13345, var_1_10=8, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L94] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) [L95] unsigned short int stepLocal_4 = var_1_1; [L96] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L97] signed long int stepLocal_2 = - var_1_10; VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=13345, stepLocal_2=-19678, stepLocal_3=130, stepLocal_4=1, var_1_10=19678, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L98] COND FALSE !(var_1_1 < stepLocal_2) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=13345, stepLocal_3=130, stepLocal_4=1, var_1_10=19678, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L103] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L104] var_1_19 = ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=13345, stepLocal_3=130, var_1_10=19678, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L165] RET step() [L166] CALL, EXPR property() [L156-L157] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= last_1_var_1_8) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_1 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (last_1_var_1_15 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_13 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_1 < (- var_1_10)) ? (((var_1_7 + (128 + var_1_1)) <= last_1_var_1_19) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_1 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; [L166] RET, EXPR property() [L166] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=19678, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=19678, var_1_11=-121233, var_1_12=-261933, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-45858, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=2, var_1_24=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=8, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 673 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 390 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 283 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 65 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3312/3312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:50:29,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.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 8c062e0b52e5b782e5946e5616c1aea186202785894035b8b4bb967c003e9581 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:50:31,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:50:31,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:50:31,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:50:31,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:50:31,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:50:31,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:50:31,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:50:31,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:50:31,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:50:31,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:50:31,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:50:31,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:50:31,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:50:31,508 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:50:31,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:50:31,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:50:31,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:50:31,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:50:31,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:50:31,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:50:31,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:50:31,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:50:31,512 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:50:31,512 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:50:31,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:50:31,513 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:50:31,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:50:31,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:50:31,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:50:31,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:50:31,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:50:31,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:50:31,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:50:31,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:50:31,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:50:31,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:50:31,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:50:31,516 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:50:31,517 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:50:31,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:50:31,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:50:31,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:50:31,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:50:31,519 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:50:31,519 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 -> 8c062e0b52e5b782e5946e5616c1aea186202785894035b8b4bb967c003e9581 [2024-10-13 00:50:31,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:50:31,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:50:31,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:50:31,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:50:31,897 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:50:31,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-10-13 00:50:33,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:50:33,689 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:50:33,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-10-13 00:50:33,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8c4a7a2/706cad98d06d48a6bd8a27761274e95f/FLAG1c2e7628c [2024-10-13 00:50:33,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8c4a7a2/706cad98d06d48a6bd8a27761274e95f [2024-10-13 00:50:33,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:50:33,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:50:33,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:50:33,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:50:33,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:50:33,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:50:33" (1/1) ... [2024-10-13 00:50:33,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d23568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:33, skipping insertion in model container [2024-10-13 00:50:33,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:50:33" (1/1) ... [2024-10-13 00:50:33,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:50:33,956 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i[915,928] [2024-10-13 00:50:34,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:50:34,061 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:50:34,078 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-77.i[915,928] [2024-10-13 00:50:34,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:50:34,144 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:50:34,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34 WrapperNode [2024-10-13 00:50:34,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:50:34,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:50:34,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:50:34,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:50:34,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,205 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-13 00:50:34,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:50:34,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:50:34,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:50:34,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:50:34,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:50:34,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:50:34,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:50:34,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:50:34,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:50:34,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (1/1) ... [2024-10-13 00:50:34,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:50:34,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:50:34,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:50:34,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:50:34,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:50:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:50:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:50:34,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:50:34,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:50:34,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:50:34,486 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:50:34,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:50:35,255 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 00:50:35,256 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:50:35,355 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:50:35,357 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:50:35,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:50:35 BoogieIcfgContainer [2024-10-13 00:50:35,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:50:35,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:50:35,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:50:35,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:50:35,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:50:33" (1/3) ... [2024-10-13 00:50:35,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350adda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:50:35, skipping insertion in model container [2024-10-13 00:50:35,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:34" (2/3) ... [2024-10-13 00:50:35,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350adda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:50:35, skipping insertion in model container [2024-10-13 00:50:35,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:50:35" (3/3) ... [2024-10-13 00:50:35,369 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-77.i [2024-10-13 00:50:35,384 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:50:35,384 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:50:35,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:50:35,456 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42c9c3f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:50:35,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:50:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:50:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 00:50:35,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:35,478 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:35,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:35,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:35,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2006507704, now seen corresponding path program 1 times [2024-10-13 00:50:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:50:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729433714] [2024-10-13 00:50:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:35,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:50:35,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:50:35,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:50:35,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:50:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:35,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:50:35,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:50:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-13 00:50:35,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:50:35,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:50:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729433714] [2024-10-13 00:50:35,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729433714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:35,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:35,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:50:35,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49692020] [2024-10-13 00:50:35,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:35,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:50:35,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:50:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:50:35,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:50:35,920 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:50:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:36,238 INFO L93 Difference]: Finished difference Result 129 states and 230 transitions. [2024-10-13 00:50:36,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:50:36,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 149 [2024-10-13 00:50:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:36,256 INFO L225 Difference]: With dead ends: 129 [2024-10-13 00:50:36,256 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 00:50:36,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:50:36,263 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:36,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:50:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 00:50:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 00:50:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:50:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2024-10-13 00:50:36,312 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 149 [2024-10-13 00:50:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:36,312 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2024-10-13 00:50:36,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:50:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2024-10-13 00:50:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 00:50:36,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:36,317 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:36,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 00:50:36,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:50:36,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash -743930056, now seen corresponding path program 1 times [2024-10-13 00:50:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:50:36,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895116911] [2024-10-13 00:50:36,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:36,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:50:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:50:36,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:50:36,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:50:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:36,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 00:50:36,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:50:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:50:36,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:50:36,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:50:36,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895116911] [2024-10-13 00:50:36,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895116911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:36,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:36,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:50:36,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118968236] [2024-10-13 00:50:36,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:36,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:50:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:50:36,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:50:36,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:50:36,879 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:50:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:37,161 INFO L93 Difference]: Finished difference Result 126 states and 195 transitions. [2024-10-13 00:50:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:50:37,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 149 [2024-10-13 00:50:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:37,173 INFO L225 Difference]: With dead ends: 126 [2024-10-13 00:50:37,173 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 00:50:37,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:50:37,175 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:37,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:50:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 00:50:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 00:50:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:50:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-13 00:50:37,187 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 149 [2024-10-13 00:50:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:37,188 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-13 00:50:37,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:50:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-13 00:50:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 00:50:37,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:37,191 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:37,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:50:37,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:50:37,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -736303560, now seen corresponding path program 1 times [2024-10-13 00:50:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:50:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800831411] [2024-10-13 00:50:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:50:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:50:37,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:50:37,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 00:50:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:37,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 00:50:37,718 INFO L278 TraceCheckSpWp]: Computing forward predicates...