./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_fillercodestructure_filler-pe-ci_file-8.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_fillercodestructure_filler-pe-ci_file-8.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 6e4478c61eea43d9784f313f7c236e7053a2a6d056bacda633ebdbec5790a68f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:41:02,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:41:02,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:41:02,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:41:02,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:41:02,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:41:02,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:41:02,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:41:02,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:41:02,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:41:02,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:41:02,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:41:02,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:41:02,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:41:02,542 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:41:02,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:41:02,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:41:02,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:41:02,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:41:02,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:41:02,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:41:02,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:41:02,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:41:02,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:41:02,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:41:02,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:41:02,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:41:02,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:41:02,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:41:02,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:41:02,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:41:02,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:41:02,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:41:02,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:41:02,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:41:02,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:41:02,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:41:02,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:41:02,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:41:02,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:41:02,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:41:02,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:41:02,548 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 -> 6e4478c61eea43d9784f313f7c236e7053a2a6d056bacda633ebdbec5790a68f [2024-10-13 01:41:02,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:41:02,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:41:02,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:41:02,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:41:02,797 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:41:02,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2024-10-13 01:41:04,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:41:04,396 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:41:04,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2024-10-13 01:41:04,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2af901eb3/fc47fffb056943afb1751a1cf2a779ba/FLAG32a1439cd [2024-10-13 01:41:04,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2af901eb3/fc47fffb056943afb1751a1cf2a779ba [2024-10-13 01:41:04,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:41:04,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:41:04,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:41:04,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:41:04,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:41:04,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8a8146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04, skipping insertion in model container [2024-10-13 01:41:04,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:41:04,646 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_fillercodestructure_filler-pe-ci_file-8.i[918,931] [2024-10-13 01:41:04,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:41:04,708 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:41:04,722 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_fillercodestructure_filler-pe-ci_file-8.i[918,931] [2024-10-13 01:41:04,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:41:04,771 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:41:04,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04 WrapperNode [2024-10-13 01:41:04,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:41:04,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:41:04,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:41:04,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:41:04,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,842 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-13 01:41:04,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:41:04,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:41:04,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:41:04,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:41:04,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,893 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 01:41:04,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:41:04,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:41:04,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:41:04,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:41:04,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (1/1) ... [2024-10-13 01:41:04,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:41:04,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:41:04,968 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 01:41:04,974 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 01:41:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:41:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:41:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:41:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:41:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:41:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:41:05,073 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:41:05,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:41:05,468 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 01:41:05,468 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:41:05,516 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:41:05,516 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:41:05,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:41:05 BoogieIcfgContainer [2024-10-13 01:41:05,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:41:05,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:41:05,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:41:05,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:41:05,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:41:04" (1/3) ... [2024-10-13 01:41:05,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e11a056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:41:05, skipping insertion in model container [2024-10-13 01:41:05,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:04" (2/3) ... [2024-10-13 01:41:05,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e11a056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:41:05, skipping insertion in model container [2024-10-13 01:41:05,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:41:05" (3/3) ... [2024-10-13 01:41:05,526 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2024-10-13 01:41:05,540 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:41:05,540 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:41:05,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:41:05,609 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;@3682866c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:41:05,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:41:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 01:41:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 01:41:05,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:05,629 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:05,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:05,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 919008708, now seen corresponding path program 1 times [2024-10-13 01:41:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:41:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142348229] [2024-10-13 01:41:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:41:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:41:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:41:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:41:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:41:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:41:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:41:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:41:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:41:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:41:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:41:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:41:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:05,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:41:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:41:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:41:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:41:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:41:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:41:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:41:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:41:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:41:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:41:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:41:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:41:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 01:41:06,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:41:06,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142348229] [2024-10-13 01:41:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142348229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:41:06,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:41:06,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:41:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485107910] [2024-10-13 01:41:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:41:06,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:41:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:41:06,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:41:06,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:41:06,097 INFO L87 Difference]: Start difference. First operand has 78 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 01:41:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:06,131 INFO L93 Difference]: Finished difference Result 153 states and 283 transitions. [2024-10-13 01:41:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:41:06,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2024-10-13 01:41:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:06,140 INFO L225 Difference]: With dead ends: 153 [2024-10-13 01:41:06,140 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 01:41:06,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 01:41:06,148 INFO L432 NwaCegarLoop]: 122 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, 122 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 01:41:06,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:41:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 01:41:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-13 01:41:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 51 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 01:41:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 125 transitions. [2024-10-13 01:41:06,222 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 125 transitions. Word has length 146 [2024-10-13 01:41:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:06,222 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 125 transitions. [2024-10-13 01:41:06,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 01:41:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 125 transitions. [2024-10-13 01:41:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 01:41:06,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:06,225 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:06,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:41:06,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:06,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 903071230, now seen corresponding path program 1 times [2024-10-13 01:41:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:41:06,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157002890] [2024-10-13 01:41:06,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:41:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:41:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:41:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:41:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:41:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:41:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:41:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:41:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:41:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:41:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:41:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:41:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:41:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:41:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:41:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:41:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:41:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:41:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:41:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:41:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:41:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:41:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:41:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:41:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 01:41:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:41:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157002890] [2024-10-13 01:41:06,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157002890] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:41:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931504793] [2024-10-13 01:41:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:06,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:41:06,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:41:06,976 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 01:41:06,980 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 01:41:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:07,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:41:07,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 01:41:07,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 01:41:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931504793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:41:07,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:41:07,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-10-13 01:41:07,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003099351] [2024-10-13 01:41:07,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:41:07,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 01:41:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:41:07,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 01:41:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:41:07,449 INFO L87 Difference]: Start difference. First operand 76 states and 125 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (37), 6 states have call predecessors, (37), 6 states have call successors, (37) [2024-10-13 01:41:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:08,494 INFO L93 Difference]: Finished difference Result 312 states and 485 transitions. [2024-10-13 01:41:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 01:41:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (37), 6 states have call predecessors, (37), 6 states have call successors, (37) Word has length 146 [2024-10-13 01:41:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:08,505 INFO L225 Difference]: With dead ends: 312 [2024-10-13 01:41:08,506 INFO L226 Difference]: Without dead ends: 237 [2024-10-13 01:41:08,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=1205, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 01:41:08,508 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 577 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:08,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 393 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:41:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-13 01:41:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 97. [2024-10-13 01:41:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 70 states have internal predecessors, (106), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 01:41:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2024-10-13 01:41:08,559 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 146 [2024-10-13 01:41:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:08,560 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2024-10-13 01:41:08,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (37), 6 states have call predecessors, (37), 6 states have call successors, (37) [2024-10-13 01:41:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2024-10-13 01:41:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 01:41:08,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:08,563 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:08,578 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 01:41:08,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:41:08,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:08,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:08,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1084765914, now seen corresponding path program 1 times [2024-10-13 01:41:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:41:08,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542700089] [2024-10-13 01:41:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:08,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:41:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:41:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:41:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:41:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:41:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:41:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:41:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:41:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 01:41:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:41:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:41:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:41:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:41:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:41:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:41:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:41:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:41:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:41:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:41:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 01:41:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:41:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 01:41:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:41:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:41:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 01:41:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:41:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542700089] [2024-10-13 01:41:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542700089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:41:09,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:41:09,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:41:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379015920] [2024-10-13 01:41:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:41:09,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:41:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:41:09,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:41:09,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:41:09,376 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 01:41:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:09,820 INFO L93 Difference]: Finished difference Result 457 states and 713 transitions. [2024-10-13 01:41:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:41:09,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-10-13 01:41:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:09,825 INFO L225 Difference]: With dead ends: 457 [2024-10-13 01:41:09,825 INFO L226 Difference]: Without dead ends: 354 [2024-10-13 01:41:09,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:41:09,829 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 263 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:09,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 523 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:41:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-13 01:41:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 200. [2024-10-13 01:41:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 147 states have (on average 1.530612244897959) internal successors, (225), 147 states have internal predecessors, (225), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 01:41:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 317 transitions. [2024-10-13 01:41:09,883 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 317 transitions. Word has length 148 [2024-10-13 01:41:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:09,884 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 317 transitions. [2024-10-13 01:41:09,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 01:41:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 317 transitions. [2024-10-13 01:41:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 01:41:09,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:09,889 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:09,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:41:09,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:09,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2095883164, now seen corresponding path program 1 times [2024-10-13 01:41:09,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:41:09,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382266233] [2024-10-13 01:41:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:41:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:41:10,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503690513] [2024-10-13 01:41:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:10,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:41:10,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:41:10,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:41:10,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:41:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:41:10,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:41:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:41:10,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:41:10,409 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:41:10,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:41:10,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 01:41:10,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 01:41:10,627 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 01:41:10,817 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:41:10,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:41:10 BoogieIcfgContainer [2024-10-13 01:41:10,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:41:10,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:41:10,833 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:41:10,834 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:41:10,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:41:05" (3/4) ... [2024-10-13 01:41:10,836 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:41:10,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:41:10,842 INFO L158 Benchmark]: Toolchain (without parser) took 6412.73ms. Allocated memory was 121.6MB in the beginning and 268.4MB in the end (delta: 146.8MB). Free memory was 54.7MB in the beginning and 230.2MB in the end (delta: -175.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:41:10,842 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory was 82.4MB in the beginning and 82.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:41:10,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.59ms. Allocated memory was 121.6MB in the beginning and 203.4MB in the end (delta: 81.8MB). Free memory was 54.4MB in the beginning and 166.5MB in the end (delta: -112.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.20ms. Allocated memory is still 203.4MB. Free memory was 166.5MB in the beginning and 159.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,843 INFO L158 Benchmark]: Boogie Preprocessor took 86.11ms. Allocated memory is still 203.4MB. Free memory was 159.2MB in the beginning and 150.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,843 INFO L158 Benchmark]: RCFGBuilder took 586.57ms. Allocated memory is still 203.4MB. Free memory was 150.8MB in the beginning and 115.1MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,843 INFO L158 Benchmark]: TraceAbstraction took 5312.40ms. Allocated memory was 203.4MB in the beginning and 268.4MB in the end (delta: 65.0MB). Free memory was 114.1MB in the beginning and 231.2MB in the end (delta: -117.1MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. [2024-10-13 01:41:10,843 INFO L158 Benchmark]: Witness Printer took 10.64ms. Allocated memory is still 268.4MB. Free memory was 231.2MB in the beginning and 230.2MB in the end (delta: 997.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:41:10,844 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory was 82.4MB in the beginning and 82.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.59ms. Allocated memory was 121.6MB in the beginning and 203.4MB in the end (delta: 81.8MB). Free memory was 54.4MB in the beginning and 166.5MB in the end (delta: -112.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.20ms. Allocated memory is still 203.4MB. Free memory was 166.5MB in the beginning and 159.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.11ms. Allocated memory is still 203.4MB. Free memory was 159.2MB in the beginning and 150.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 586.57ms. Allocated memory is still 203.4MB. Free memory was 150.8MB in the beginning and 115.1MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5312.40ms. Allocated memory was 203.4MB in the beginning and 268.4MB in the end (delta: 65.0MB). Free memory was 114.1MB in the beginning and 231.2MB in the end (delta: -117.1MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. * Witness Printer took 10.64ms. Allocated memory is still 268.4MB. Free memory was 231.2MB in the beginning and 230.2MB in the end (delta: 997.6kB). 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 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999999999.675; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] unsigned long int var_1_9 = 1; [L28] double var_1_10 = 63.25; [L29] unsigned char var_1_11 = 0; [L30] unsigned short int var_1_13 = 0; [L31] unsigned short int var_1_15 = 17766; [L32] unsigned short int var_1_16 = 28149; [L33] unsigned char var_1_19 = 4; [L34] unsigned char var_1_20 = 50; [L35] unsigned char var_1_21 = 64; [L36] unsigned char var_1_22 = 50; [L37] unsigned char var_1_23 = 5; [L38] unsigned char var_1_24 = 128; [L39] signed long int var_1_25 = -16; [L40] unsigned char var_1_26 = 0; [L41] signed short int var_1_27 = -4; [L42] unsigned short int var_1_33 = 2; [L43] signed long int var_1_36 = -1; [L44] float var_1_38 = 256.7; [L45] unsigned long int var_1_40 = 10; [L46] double var_1_42 = 100.5; [L47] signed char var_1_45 = 8; [L48] unsigned short int last_1_var_1_13 = 0; [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L175] last_1_var_1_13 = var_1_13 [L185] RET updateLastVariables() [L186] CALL updateVariables() [L138] var_1_4 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L139] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L142] var_1_5 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L143] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L146] var_1_10 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L152] var_1_15 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L153] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L155] var_1_16 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_20 >= 32) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L161] var_1_21 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_21 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L162] RET assume_abort_if_not(var_1_21 >= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L164] var_1_22 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L165] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_22 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] RET assume_abort_if_not(var_1_22 <= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L167] var_1_23 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L170] var_1_24 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L171] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L52] COND TRUE last_1_var_1_13 == (last_1_var_1_13 % var_1_4) [L53] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L55] COND FALSE !(var_1_10 == var_1_1) [L62] var_1_19 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L64] COND FALSE !(var_1_19 < (var_1_21 / var_1_20)) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L71] COND TRUE var_1_1 >= var_1_6 [L72] var_1_7 = var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L74] COND FALSE !(((var_1_6 * var_1_5) / var_1_10) > var_1_1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L81] COND FALSE !(var_1_7 < var_1_9) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L84] COND FALSE !((25.3 * var_1_5) != var_1_1) [L93] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L95] COND TRUE var_1_16 != (var_1_24 + var_1_21) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L96] COND TRUE \read(var_1_11) [L97] var_1_27 = ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L102] COND TRUE \read(var_1_11) [L103] var_1_33 = ((((var_1_16) > (var_1_26)) ? (var_1_16) : (var_1_26))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L105] COND TRUE 16 < var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L106] COND FALSE !(var_1_23 <= var_1_4) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L112] var_1_38 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=2, var_1_7=127, var_1_9=1] [L113] COND FALSE !(var_1_20 <= var_1_22) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=2, var_1_7=127, var_1_9=1] [L120] COND TRUE var_1_24 < ((((((((var_1_15) > (var_1_20)) ? (var_1_15) : (var_1_20)))) > (var_1_15)) ? (((((var_1_15) > (var_1_20)) ? (var_1_15) : (var_1_20)))) : (var_1_15))) [L121] var_1_42 = var_1_6 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=8, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=127, var_1_9=1] [L131] COND TRUE (var_1_23 % var_1_20) < var_1_20 [L132] var_1_45 = ((var_1_20 - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=64, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=127, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((last_1_var_1_13 == (last_1_var_1_13 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((var_1_1 >= var_1_6) ? (var_1_7 == ((signed long int) var_1_19)) : 1)) && ((((var_1_6 * var_1_5) / var_1_10) > var_1_1) ? (var_1_11 ? (var_1_9 == ((unsigned long int) var_1_26)) : (var_1_9 == ((unsigned long int) var_1_26))) : 1)) && ((var_1_7 < var_1_9) ? (var_1_13 == ((unsigned short int) (var_1_26 + (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - (var_1_19 + var_1_19))))) : 1)) && ((var_1_10 == var_1_1) ? (var_1_11 ? (var_1_19 == ((unsigned char) (((32 + var_1_20) + var_1_21) - (var_1_22 + var_1_23)))) : (var_1_19 == ((unsigned char) (var_1_24 - var_1_23)))) : (var_1_19 == ((unsigned char) var_1_24)))) && (((25.3 * var_1_5) != var_1_1) ? (var_1_11 ? ((var_1_15 <= var_1_13) ? (var_1_25 == ((signed long int) var_1_26)) : 1) : (var_1_25 == ((signed long int) var_1_22))) : (var_1_25 == ((signed long int) var_1_20)))) && ((var_1_19 < (var_1_21 / var_1_20)) ? ((var_1_19 > var_1_19) ? (var_1_26 == ((unsigned char) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (var_1_23)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (var_1_23))))) : (var_1_26 == ((unsigned char) var_1_22))) : 1) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=64, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=127, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=127, var_1_20=-224, var_1_21=64, var_1_22=1, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=64, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=127, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 1038 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 527 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 637 IncrementalHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 511 mSDtfsCounter, 637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=3, InterpolantAutomatonStates: 39, 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, 294 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 727 ConstructedInterpolants, 0 QuantifiedInterpolants, 1548 SizeOfPredicates, 1 NumberOfNonLiveVariables, 340 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5021/5060 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 01:41:10,910 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_fillercodestructure_filler-pe-ci_file-8.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 6e4478c61eea43d9784f313f7c236e7053a2a6d056bacda633ebdbec5790a68f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:41:12,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:41:12,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:41:12,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:41:12,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:41:13,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:41:13,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:41:13,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:41:13,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:41:13,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:41:13,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:41:13,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:41:13,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:41:13,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:41:13,020 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:41:13,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:41:13,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:41:13,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:41:13,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:41:13,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:41:13,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:41:13,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:41:13,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:41:13,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:41:13,022 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:41:13,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:41:13,023 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:41:13,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:41:13,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:41:13,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:41:13,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:41:13,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:41:13,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:41:13,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:41:13,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:41:13,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:41:13,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:41:13,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:41:13,026 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:41:13,026 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:41:13,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:41:13,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:41:13,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:41:13,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:41:13,027 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:41:13,027 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e4478c61eea43d9784f313f7c236e7053a2a6d056bacda633ebdbec5790a68f [2024-10-13 01:41:13,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:41:13,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:41:13,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:41:13,309 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:41:13,313 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:41:13,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2024-10-13 01:41:14,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:41:15,057 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:41:15,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2024-10-13 01:41:15,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069f7d996/c0ac77dcaba24da196555c76c244a767/FLAGe791c94ea [2024-10-13 01:41:15,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069f7d996/c0ac77dcaba24da196555c76c244a767 [2024-10-13 01:41:15,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:41:15,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:41:15,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:41:15,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:41:15,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:41:15,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614d8710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15, skipping insertion in model container [2024-10-13 01:41:15,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:41:15,278 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_fillercodestructure_filler-pe-ci_file-8.i[918,931] [2024-10-13 01:41:15,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:41:15,340 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:41:15,352 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_fillercodestructure_filler-pe-ci_file-8.i[918,931] [2024-10-13 01:41:15,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:41:15,403 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:41:15,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15 WrapperNode [2024-10-13 01:41:15,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:41:15,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:41:15,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:41:15,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:41:15,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,466 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-13 01:41:15,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:41:15,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:41:15,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:41:15,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:41:15,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,504 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 01:41:15,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:41:15,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:41:15,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:41:15,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:41:15,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (1/1) ... [2024-10-13 01:41:15,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:41:15,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:41:15,564 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 01:41:15,566 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 01:41:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:41:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:41:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:41:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:41:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:41:15,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:41:15,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:41:15,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:41:35,983 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 01:41:35,983 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:41:36,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:41:36,052 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:41:36,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:41:36 BoogieIcfgContainer [2024-10-13 01:41:36,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:41:36,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:41:36,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:41:36,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:41:36,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:41:15" (1/3) ... [2024-10-13 01:41:36,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559e6e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:41:36, skipping insertion in model container [2024-10-13 01:41:36,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:41:15" (2/3) ... [2024-10-13 01:41:36,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559e6e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:41:36, skipping insertion in model container [2024-10-13 01:41:36,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:41:36" (3/3) ... [2024-10-13 01:41:36,063 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2024-10-13 01:41:36,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:41:36,078 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:41:36,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:41:36,169 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@385ef49b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:41:36,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:41:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.625) internal successors, (78), 49 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 01:41:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 01:41:36,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:36,187 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:36,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:36,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1574032695, now seen corresponding path program 1 times [2024-10-13 01:41:36,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:36,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475959538] [2024-10-13 01:41:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:36,203 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 01:41:36,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:36,206 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 01:41:36,207 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 01:41:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:37,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:41:37,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-13 01:41:37,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:41:37,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:37,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475959538] [2024-10-13 01:41:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475959538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:41:37,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:41:37,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:41:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276501240] [2024-10-13 01:41:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:41:37,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:41:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:41:37,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:41:37,320 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.625) internal successors, (78), 49 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 01:41:41,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:41,902 INFO L93 Difference]: Finished difference Result 145 states and 269 transitions. [2024-10-13 01:41:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:41:42,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2024-10-13 01:41:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:42,113 INFO L225 Difference]: With dead ends: 145 [2024-10-13 01:41:42,113 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 01:41:42,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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 01:41:42,120 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:42,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 01:41:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 01:41:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 01:41:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 47 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 01:41:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 118 transitions. [2024-10-13 01:41:42,161 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 118 transitions. Word has length 146 [2024-10-13 01:41:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:42,161 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 118 transitions. [2024-10-13 01:41:42,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 01:41:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 118 transitions. [2024-10-13 01:41:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 01:41:42,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:42,166 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:42,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:41:42,367 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 01:41:42,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:42,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1558095217, now seen corresponding path program 1 times [2024-10-13 01:41:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:42,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425101521] [2024-10-13 01:41:42,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:42,370 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 01:41:42,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:42,375 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 01:41:42,377 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 01:41:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:43,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 01:41:43,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 01:41:51,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:53,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:53,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425101521] [2024-10-13 01:41:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425101521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:41:53,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1022821892] [2024-10-13 01:41:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:53,442 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:41:53,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:41:53,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 01:41:53,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 01:41:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:55,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:41:55,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:42:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 01:42:02,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:42:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1022821892] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:42:02,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:42:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-10-13 01:42:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717394741] [2024-10-13 01:42:02,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:42:02,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:42:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:42:02,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:42:02,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:42:02,894 INFO L87 Difference]: Start difference. First operand 72 states and 118 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 01:42:16,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:42:20,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:42:24,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:42:28,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:42:32,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:42:36,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 01:42:40,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:42:44,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []