./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-pr-ci_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:33:40,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:33:40,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:33:40,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:33:40,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:33:40,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:33:40,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:33:40,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:33:40,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:33:40,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:33:40,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:33:40,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:33:40,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:33:40,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:33:40,517 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:33:40,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:33:40,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:33:40,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:33:40,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:33:40,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:33:40,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:33:40,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:33:40,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:33:40,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:33:40,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:33:40,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:33:40,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:33:40,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:33:40,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:33:40,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:33:40,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:33:40,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:33:40,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:33:40,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:33:40,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:33:40,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:33:40,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:33:40,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:33:40,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:33:40,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:33:40,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:33:40,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:33:40,524 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-clean/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-clean/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 -> 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b [2024-10-11 09:33:40,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:33:40,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:33:40,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:33:40,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:33:40,812 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:33:40,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-10-11 09:33:42,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:33:42,248 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:33:42,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-10-11 09:33:42,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9954bdac/5e3aa4c69ffc4960bcfdced5cc620558/FLAG8c165618a [2024-10-11 09:33:42,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9954bdac/5e3aa4c69ffc4960bcfdced5cc620558 [2024-10-11 09:33:42,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:33:42,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:33:42,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:33:42,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:33:42,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:33:42,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:42,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5210521c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42, skipping insertion in model container [2024-10-11 09:33:42,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:42,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:33:42,817 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-pr-ci_file-83.i[919,932] [2024-10-11 09:33:42,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:33:42,898 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:33:42,907 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-pr-ci_file-83.i[919,932] [2024-10-11 09:33:42,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:33:42,951 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:33:42,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42 WrapperNode [2024-10-11 09:33:42,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:33:42,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:33:42,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:33:42,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:33:42,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:42,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,012 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2024-10-11 09:33:43,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:33:43,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:33:43,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:33:43,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:33:43,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,068 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-11 09:33:43,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:33:43,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:33:43,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:33:43,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:33:43,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (1/1) ... [2024-10-11 09:33:43,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:33:43,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:43,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:33:43,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:33:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:33:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:33:43,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:33:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:33:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:33:43,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:33:43,307 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:33:43,311 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:33:43,772 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 09:33:43,773 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:33:43,805 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:33:43,805 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:33:43,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:33:43 BoogieIcfgContainer [2024-10-11 09:33:43,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:33:43,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:33:43,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:33:43,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:33:43,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:33:42" (1/3) ... [2024-10-11 09:33:43,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a603d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:33:43, skipping insertion in model container [2024-10-11 09:33:43,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:42" (2/3) ... [2024-10-11 09:33:43,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a603d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:33:43, skipping insertion in model container [2024-10-11 09:33:43,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:33:43" (3/3) ... [2024-10-11 09:33:43,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-10-11 09:33:43,828 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:33:43,828 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:33:43,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:33:43,890 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;@34ab4d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:33:43,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:33:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 72 states have (on average 1.5972222222222223) internal successors, (115), 73 states have internal predecessors, (115), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:33:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 09:33:43,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:43,912 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:33:43,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:43,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash 919647580, now seen corresponding path program 1 times [2024-10-11 09:33:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:43,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345220393] [2024-10-11 09:33:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:33:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:33:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:33:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:33:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:33:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:33:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:33:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:33:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:33:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:33:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:33:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:33:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:33:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:33:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:33:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:33:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:33:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:33:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:33:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:33:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:33:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 09:33:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345220393] [2024-10-11 09:33:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345220393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:33:44,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708791156] [2024-10-11 09:33:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:44,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:44,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:44,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:33:44,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:33:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:45,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 09:33:45,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 431 proven. 66 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-11 09:33:45,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:33:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708791156] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:33:45,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:33:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 15 [2024-10-11 09:33:45,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968239843] [2024-10-11 09:33:45,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:33:45,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 09:33:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 09:33:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-11 09:33:45,922 INFO L87 Difference]: Start difference. First operand has 96 states, 72 states have (on average 1.5972222222222223) internal successors, (115), 73 states have internal predecessors, (115), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-11 09:33:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:47,369 INFO L93 Difference]: Finished difference Result 317 states and 553 transitions. [2024-10-11 09:33:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 09:33:47,372 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 141 [2024-10-11 09:33:47,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:47,390 INFO L225 Difference]: With dead ends: 317 [2024-10-11 09:33:47,390 INFO L226 Difference]: Without dead ends: 222 [2024-10-11 09:33:47,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=2149, Unknown=0, NotChecked=0, Total=2756 [2024-10-11 09:33:47,398 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 464 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:47,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 424 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:33:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-11 09:33:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 139. [2024-10-11 09:33:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 94 states have internal predecessors, (116), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:33:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 190 transitions. [2024-10-11 09:33:47,457 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 190 transitions. Word has length 141 [2024-10-11 09:33:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:47,458 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 190 transitions. [2024-10-11 09:33:47,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 14 states have internal predecessors, (77), 5 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-11 09:33:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2024-10-11 09:33:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 09:33:47,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:47,463 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:33:47,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:33:47,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 09:33:47,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:47,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash 476748440, now seen corresponding path program 1 times [2024-10-11 09:33:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694572637] [2024-10-11 09:33:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:47,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:33:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:33:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:33:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:33:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:33:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:33:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:33:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:33:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:33:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:33:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:33:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:33:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:33:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:33:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:33:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:33:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:33:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:33:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:33:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:33:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:33:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 81 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-10-11 09:33:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694572637] [2024-10-11 09:33:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694572637] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:33:48,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137753339] [2024-10-11 09:33:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:48,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:48,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:33:48,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:33:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:48,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 09:33:48,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 563 proven. 111 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-10-11 09:33:49,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:33:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 90 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-10-11 09:33:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137753339] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:33:50,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:33:50,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 13] total 31 [2024-10-11 09:33:50,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070895207] [2024-10-11 09:33:50,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:33:50,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 09:33:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 09:33:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2024-10-11 09:33:50,445 INFO L87 Difference]: Start difference. First operand 139 states and 190 transitions. Second operand has 31 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 31 states have internal predecessors, (107), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2024-10-11 09:33:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:52,944 INFO L93 Difference]: Finished difference Result 422 states and 538 transitions. [2024-10-11 09:33:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-11 09:33:52,944 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 31 states have internal predecessors, (107), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) Word has length 141 [2024-10-11 09:33:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:52,949 INFO L225 Difference]: With dead ends: 422 [2024-10-11 09:33:52,952 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 09:33:52,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2123 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1601, Invalid=5709, Unknown=0, NotChecked=0, Total=7310 [2024-10-11 09:33:52,957 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 578 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:52,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 516 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:33:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 09:33:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 183. [2024-10-11 09:33:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 128 states have (on average 1.203125) internal successors, (154), 129 states have internal predecessors, (154), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:33:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 228 transitions. [2024-10-11 09:33:52,996 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 228 transitions. Word has length 141 [2024-10-11 09:33:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:52,997 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 228 transitions. [2024-10-11 09:33:52,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 31 states have internal predecessors, (107), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2024-10-11 09:33:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 228 transitions. [2024-10-11 09:33:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 09:33:52,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:52,999 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:33:53,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:33:53,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:53,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:53,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1724855339, now seen corresponding path program 1 times [2024-10-11 09:33:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333223873] [2024-10-11 09:33:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:33:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:33:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:33:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:33:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:33:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:33:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:33:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:33:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:33:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:33:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:33:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:33:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:33:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:33:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:33:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:33:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:33:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:33:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:33:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:33:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:33:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 81 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-10-11 09:33:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333223873] [2024-10-11 09:33:53,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333223873] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:33:53,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714062984] [2024-10-11 09:33:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:53,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:53,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:53,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:33:53,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:33:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:54,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 09:33:54,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 09:33:54,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:33:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 42 proven. 75 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-10-11 09:33:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714062984] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:33:54,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:33:54,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2024-10-11 09:33:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517650635] [2024-10-11 09:33:54,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:33:54,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 09:33:54,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 09:33:54,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 09:33:54,690 INFO L87 Difference]: Start difference. First operand 183 states and 228 transitions. Second operand has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) [2024-10-11 09:33:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:55,724 INFO L93 Difference]: Finished difference Result 336 states and 415 transitions. [2024-10-11 09:33:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 09:33:55,725 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) Word has length 142 [2024-10-11 09:33:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:55,726 INFO L225 Difference]: With dead ends: 336 [2024-10-11 09:33:55,726 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 09:33:55,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=543, Invalid=1619, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 09:33:55,728 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 618 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:55,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 350 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:33:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 09:33:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2024-10-11 09:33:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 133 states have (on average 1.1879699248120301) internal successors, (158), 134 states have internal predecessors, (158), 37 states have call successors, (37), 19 states have call predecessors, (37), 19 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:33:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 232 transitions. [2024-10-11 09:33:55,759 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 232 transitions. Word has length 142 [2024-10-11 09:33:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:55,760 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 232 transitions. [2024-10-11 09:33:55,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) [2024-10-11 09:33:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions. [2024-10-11 09:33:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 09:33:55,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:55,762 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:33:55,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:33:55,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:55,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:55,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1466689901, now seen corresponding path program 1 times [2024-10-11 09:33:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:55,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650015502] [2024-10-11 09:33:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:33:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:33:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:33:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:33:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:33:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:33:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:33:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:33:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:33:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:33:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:33:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:33:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:33:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:33:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:33:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:33:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:33:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:33:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:33:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:33:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:33:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 99 proven. 105 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2024-10-11 09:33:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650015502] [2024-10-11 09:33:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650015502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:33:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811204961] [2024-10-11 09:33:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:56,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:56,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:56,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:33:56,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:33:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:56,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 09:33:56,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 555 proven. 132 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-11 09:33:57,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:33:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811204961] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:33:59,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:33:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 22 [2024-10-11 09:33:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267129772] [2024-10-11 09:33:59,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:33:59,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 09:33:59,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:59,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 09:33:59,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2024-10-11 09:33:59,516 INFO L87 Difference]: Start difference. First operand 190 states and 232 transitions. Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2024-10-11 09:34:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:00,486 INFO L93 Difference]: Finished difference Result 338 states and 414 transitions. [2024-10-11 09:34:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 09:34:00,487 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) Word has length 142 [2024-10-11 09:34:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:00,489 INFO L225 Difference]: With dead ends: 338 [2024-10-11 09:34:00,489 INFO L226 Difference]: Without dead ends: 206 [2024-10-11 09:34:00,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=936, Invalid=2970, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 09:34:00,495 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 511 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:00,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 279 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:34:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-11 09:34:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 190. [2024-10-11 09:34:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 133 states have (on average 1.1729323308270676) internal successors, (156), 134 states have internal predecessors, (156), 37 states have call successors, (37), 19 states have call predecessors, (37), 19 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:34:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 230 transitions. [2024-10-11 09:34:00,532 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 230 transitions. Word has length 142 [2024-10-11 09:34:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:00,533 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 230 transitions. [2024-10-11 09:34:00,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2024-10-11 09:34:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 230 transitions. [2024-10-11 09:34:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 09:34:00,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:00,534 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:34:00,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 09:34:00,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:34:00,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:00,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:00,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1301041532, now seen corresponding path program 1 times [2024-10-11 09:34:00,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:34:00,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015003417] [2024-10-11 09:34:00,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:00,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:34:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:34:00,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411420290] [2024-10-11 09:34:00,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:00,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:34:00,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:34:00,794 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:34:00,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 09:34:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:34:00,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:34:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:34:01,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:34:01,020 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:34:01,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:34:01,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 09:34:01,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:34:01,227 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 09:34:01,320 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:34:01,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:34:01 BoogieIcfgContainer [2024-10-11 09:34:01,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:34:01,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:34:01,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:34:01,327 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:34:01,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:33:43" (3/4) ... [2024-10-11 09:34:01,329 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:34:01,330 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:34:01,330 INFO L158 Benchmark]: Toolchain (without parser) took 18683.22ms. Allocated memory was 174.1MB in the beginning and 390.1MB in the end (delta: 216.0MB). Free memory was 126.0MB in the beginning and 184.3MB in the end (delta: -58.3MB). Peak memory consumption was 156.9MB. Max. memory is 16.1GB. [2024-10-11 09:34:01,331 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 58.5MB in the beginning and 58.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:34:01,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.70ms. Allocated memory is still 174.1MB. Free memory was 126.0MB in the beginning and 109.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 09:34:01,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.94ms. Allocated memory is still 174.1MB. Free memory was 108.6MB in the beginning and 101.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 09:34:01,331 INFO L158 Benchmark]: Boogie Preprocessor took 106.61ms. Allocated memory is still 174.1MB. Free memory was 101.5MB in the beginning and 139.2MB in the end (delta: -37.7MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-11 09:34:01,331 INFO L158 Benchmark]: RCFGBuilder took 685.91ms. Allocated memory is still 174.1MB. Free memory was 139.2MB in the beginning and 105.5MB in the end (delta: 33.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 09:34:01,332 INFO L158 Benchmark]: TraceAbstraction took 17518.02ms. Allocated memory was 174.1MB in the beginning and 390.1MB in the end (delta: 216.0MB). Free memory was 104.5MB in the beginning and 185.3MB in the end (delta: -80.9MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. [2024-10-11 09:34:01,332 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 390.1MB. Free memory was 185.3MB in the beginning and 184.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:34:01,333 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.17ms. Allocated memory is still 96.5MB. Free memory was 58.5MB in the beginning and 58.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.70ms. Allocated memory is still 174.1MB. Free memory was 126.0MB in the beginning and 109.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.94ms. Allocated memory is still 174.1MB. Free memory was 108.6MB in the beginning and 101.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.61ms. Allocated memory is still 174.1MB. Free memory was 101.5MB in the beginning and 139.2MB in the end (delta: -37.7MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * RCFGBuilder took 685.91ms. Allocated memory is still 174.1MB. Free memory was 139.2MB in the beginning and 105.5MB in the end (delta: 33.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17518.02ms. Allocated memory was 174.1MB in the beginning and 390.1MB in the end (delta: 216.0MB). Free memory was 104.5MB in the beginning and 185.3MB in the end (delta: -80.9MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 390.1MB. Free memory was 185.3MB in the beginning and 184.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryArithmeticFLOAToperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1230640054; [L25] signed long int var_1_6 = 1508873667; [L26] unsigned char var_1_7 = 64; [L27] unsigned char var_1_8 = 200; [L28] unsigned char var_1_9 = 16; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 8; [L31] float var_1_12 = 15.4; [L32] float var_1_16 = 10000000000000.375; [L33] float var_1_17 = 16.4; [L34] float var_1_18 = 8.5; [L35] float var_1_19 = 64.75; [L36] unsigned char var_1_20 = 16; [L37] signed char var_1_22 = 0; [L38] unsigned char var_1_23 = 16; [L39] unsigned char var_1_24 = 128; [L40] signed short int var_1_30 = -256; [L41] signed short int var_1_31 = 2; [L42] signed short int var_1_34 = -2; [L43] signed short int var_1_36 = -50; [L44] unsigned char var_1_37 = 4; [L45] unsigned char var_1_38 = 64; [L46] float var_1_40 = 0.8; [L47] signed short int var_1_44 = 1; [L48] signed long int var_1_45 = 4; [L49] float var_1_46 = 1000000000000.375; [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] FCALL updateLastVariables() [L164] CALL updateVariables() [L120] var_1_2 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L121] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L123] var_1_3 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L124] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L126] var_1_6 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_6 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L127] RET assume_abort_if_not(var_1_6 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L128] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L128] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L130] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L131] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L131] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L132] var_1_9 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L133] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L134] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L134] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L135] var_1_10 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L137] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L138] var_1_11 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L139] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L140] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L141] var_1_17 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L142] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L143] var_1_18 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L144] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L146] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L147] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_20 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L148] RET assume_abort_if_not(var_1_20 != 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L149] var_1_38 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_38 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L150] RET assume_abort_if_not(var_1_38 >= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L151] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L164] RET updateVariables() [L165] CALL step() [L53] var_1_7 = ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L54] COND FALSE !(1 >= var_1_3) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L59] COND TRUE \read(var_1_2) [L60] var_1_45 = (((((var_1_10 + var_1_38)) < (var_1_10)) ? ((var_1_10 + var_1_38)) : (var_1_10))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L62] var_1_16 = (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L63] COND FALSE !((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) [L70] var_1_23 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L72] COND FALSE !(((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) < var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L77] COND TRUE \read(var_1_2) [L78] var_1_1 = ((var_1_3 - var_1_7) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L82] var_1_30 = var_1_8 [L83] var_1_46 = var_1_17 [L84] signed long int stepLocal_1 = var_1_9 % (var_1_8 - var_1_20); VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L85] EXPR var_1_7 ^ var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L85] signed long int stepLocal_0 = var_1_7 ^ var_1_10; [L86] COND FALSE !(stepLocal_1 > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L91] EXPR var_1_9 & var_1_9 VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L91] COND FALSE !(var_1_8 <= (var_1_9 & var_1_9)) [L94] COND TRUE (var_1_11 % var_1_20) < var_1_1 [L95] var_1_22 = ((((10) > (var_1_10)) ? (10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L97] COND TRUE \read(var_1_2) [L98] var_1_40 = ((((var_1_17) > ((var_1_18 + var_1_17))) ? (var_1_17) : ((var_1_18 + var_1_17)))) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L100] COND TRUE ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f)) [L101] var_1_12 = 31.5f VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L103] COND TRUE (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) >= (var_1_20 % var_1_20)) || var_1_2 [L104] var_1_24 = ((((var_1_8 - 8) < 0 ) ? -(var_1_8 - 8) : (var_1_8 - 8))) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L108] COND TRUE var_1_3 >= ((((32) > (var_1_8)) ? (32) : (var_1_8))) [L109] var_1_37 = (var_1_8 - (var_1_38 - var_1_9)) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L113] COND FALSE !(var_1_17 != var_1_19) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L165] RET step() [L166] CALL, EXPR property() [L156] EXPR ((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L156-L157] return ((((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1)) && (((var_1_11 % var_1_20) < var_1_1) ? (var_1_22 == ((signed char) ((((10) > (var_1_10)) ? (10) : (var_1_10))))) : 1)) && (((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) ? ((var_1_10 > var_1_7) ? (var_1_23 == ((unsigned char) ((((var_1_20) < ((var_1_8 - var_1_9))) ? (var_1_20) : ((var_1_8 - var_1_9)))))) : (var_1_23 == ((unsigned char) (((((var_1_20) > (64)) ? (var_1_20) : (64))) + var_1_11)))) : (var_1_23 == ((unsigned char) var_1_20))) ; [L166] RET, EXPR property() [L166] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2174 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2171 mSDsluCounter, 1569 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1246 mSDsCounter, 698 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2651 IncrementalHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 698 mSolverCounterUnsat, 323 mSDtfsCounter, 2651 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1333 GetRequests, 1089 SyntacticMatches, 3 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4246 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=3, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 250 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1416 NumberOfCodeBlocks, 1416 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1405 ConstructedInterpolants, 0 QuantifiedInterpolants, 11396 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1352 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 10 InterpolantComputations, 0 PerfectInterpolantSequences, 7545/8400 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-11 09:34:01,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:34:03,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:34:03,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:34:03,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:34:03,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:34:03,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:34:03,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:34:03,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:34:03,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:34:03,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:34:03,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:34:03,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:34:03,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:34:03,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:34:03,471 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:34:03,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:34:03,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:34:03,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:34:03,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:34:03,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:34:03,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:34:03,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:34:03,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:34:03,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:34:03,476 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:34:03,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:34:03,477 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:34:03,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:34:03,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:34:03,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:34:03,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:34:03,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:34:03,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:34:03,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:34:03,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:34:03,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:34:03,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:34:03,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:34:03,479 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:34:03,479 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:34:03,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:34:03,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:34:03,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:34:03,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:34:03,482 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:34:03,483 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-clean/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-clean/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 -> 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b [2024-10-11 09:34:03,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:34:03,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:34:03,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:34:03,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:34:03,780 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:34:03,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-10-11 09:34:05,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:34:05,368 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:34:05,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-10-11 09:34:05,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6205bb017/771df58eed0c4ea9acbc36d132e466ff/FLAG875e77b84 [2024-10-11 09:34:05,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6205bb017/771df58eed0c4ea9acbc36d132e466ff [2024-10-11 09:34:05,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:34:05,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:34:05,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:34:05,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:34:05,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:34:05,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:34:05" (1/1) ... [2024-10-11 09:34:05,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c79fdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:05, skipping insertion in model container [2024-10-11 09:34:05,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:34:05" (1/1) ... [2024-10-11 09:34:05,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:34:05,918 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-pr-ci_file-83.i[919,932] [2024-10-11 09:34:05,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:34:05,999 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:34:06,008 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-pr-ci_file-83.i[919,932] [2024-10-11 09:34:06,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:34:06,064 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:34:06,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06 WrapperNode [2024-10-11 09:34:06,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:34:06,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:34:06,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:34:06,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:34:06,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,117 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-10-11 09:34:06,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:34:06,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:34:06,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:34:06,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:34:06,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,149 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-11 09:34:06,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:34:06,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:34:06,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:34:06,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:34:06,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (1/1) ... [2024-10-11 09:34:06,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:34:06,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:34:06,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:34:06,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:34:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:34:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:34:06,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:34:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:34:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:34:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:34:06,342 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:34:06,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:34:08,398 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 09:34:08,398 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:34:08,466 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:34:08,466 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:34:08,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:34:08 BoogieIcfgContainer [2024-10-11 09:34:08,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:34:08,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:34:08,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:34:08,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:34:08,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:34:05" (1/3) ... [2024-10-11 09:34:08,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a1c1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:34:08, skipping insertion in model container [2024-10-11 09:34:08,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:34:06" (2/3) ... [2024-10-11 09:34:08,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a1c1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:34:08, skipping insertion in model container [2024-10-11 09:34:08,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:34:08" (3/3) ... [2024-10-11 09:34:08,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-10-11 09:34:08,489 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:34:08,490 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:34:08,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:34:08,562 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;@335bcd08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:34:08,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:34:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 42 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:34:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:34:08,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:08,580 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:34:08,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:08,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash -506872327, now seen corresponding path program 1 times [2024-10-11 09:34:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:34:08,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593378959] [2024-10-11 09:34:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:08,601 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-11 09:34:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:34:08,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 09:34:08,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:34:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:09,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:34:09,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:34:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-10-11 09:34:09,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:34:09,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:34:09,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593378959] [2024-10-11 09:34:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593378959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:34:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:34:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465884009] [2024-10-11 09:34:09,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:09,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:34:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:34:09,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:34:09,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:34:09,154 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 42 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 09:34:10,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:10,649 INFO L93 Difference]: Finished difference Result 126 states and 229 transitions. [2024-10-11 09:34:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:34:10,675 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2024-10-11 09:34:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:10,681 INFO L225 Difference]: With dead ends: 126 [2024-10-11 09:34:10,681 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 09:34:10,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-11 09:34:10,685 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:10,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 09:34:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 09:34:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 09:34:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:34:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2024-10-11 09:34:10,721 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 136 [2024-10-11 09:34:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:10,721 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2024-10-11 09:34:10,721 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 09:34:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2024-10-11 09:34:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:34:10,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:10,724 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:34:10,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:34:10,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 09:34:10,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash 79948607, now seen corresponding path program 1 times [2024-10-11 09:34:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:34:10,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219672357] [2024-10-11 09:34:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:10,927 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-11 09:34:10,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:34:10,929 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 09:34:10,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:34:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:11,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:34:11,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:34:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 09:34:12,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:34:13,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:34:13,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219672357] [2024-10-11 09:34:13,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219672357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:34:13,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [649908800] [2024-10-11 09:34:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:13,124 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:34:13,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:34:13,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:34:13,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 09:34:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:13,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:34:13,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:34:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 09:34:13,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:34:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [649908800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:34:13,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:34:13,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 09:34:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837517441] [2024-10-11 09:34:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:34:13,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:34:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:34:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:34:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:34:13,544 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 09:34:14,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:14,867 INFO L93 Difference]: Finished difference Result 145 states and 227 transitions. [2024-10-11 09:34:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:34:14,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-10-11 09:34:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:14,895 INFO L225 Difference]: With dead ends: 145 [2024-10-11 09:34:14,895 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 09:34:14,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:34:14,903 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 26 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:14,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 176 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 09:34:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 09:34:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2024-10-11 09:34:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:34:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2024-10-11 09:34:14,919 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 136 [2024-10-11 09:34:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:14,923 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2024-10-11 09:34:14,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 09:34:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2024-10-11 09:34:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:34:14,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:14,925 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:34:14,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 09:34:15,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-11 09:34:15,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 09:34:15,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:15,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash -729398019, now seen corresponding path program 1 times [2024-10-11 09:34:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:34:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689772404] [2024-10-11 09:34:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:15,328 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-11 09:34:15,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:34:15,331 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 09:34:15,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 09:34:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:15,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:34:15,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:34:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 09:34:17,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:34:17,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:34:17,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689772404] [2024-10-11 09:34:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689772404] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:34:17,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1330461876] [2024-10-11 09:34:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:17,543 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:34:17,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:34:17,545 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:34:17,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 09:34:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:18,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:34:18,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:34:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 09:34:20,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:34:20,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1330461876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:34:20,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:34:20,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 09:34:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975550526] [2024-10-11 09:34:20,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:34:20,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:34:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:34:20,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:34:20,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:34:20,509 INFO L87 Difference]: Start difference. First operand 73 states and 114 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 09:34:23,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:23,335 INFO L93 Difference]: Finished difference Result 157 states and 237 transitions. [2024-10-11 09:34:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:34:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 136 [2024-10-11 09:34:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:23,365 INFO L225 Difference]: With dead ends: 157 [2024-10-11 09:34:23,365 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 09:34:23,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-10-11 09:34:23,367 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 72 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:23,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 207 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 09:34:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 09:34:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-10-11 09:34:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:34:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-10-11 09:34:23,377 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 136 [2024-10-11 09:34:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-10-11 09:34:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 09:34:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-10-11 09:34:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:34:23,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:23,380 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:34:23,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-11 09:34:23,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 09:34:23,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-clean/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-11 09:34:23,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:23,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1122425029, now seen corresponding path program 1 times [2024-10-11 09:34:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:34:23,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792988199] [2024-10-11 09:34:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:23,782 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-11 09:34:23,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:34:23,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 09:34:23,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 09:34:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:24,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:34:24,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:34:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 362 proven. 93 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-11 09:34:26,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:34:27,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:34:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792988199] [2024-10-11 09:34:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792988199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:34:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1295380739] [2024-10-11 09:34:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:27,414 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:34:27,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:34:27,417 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:34:27,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 09:34:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:28,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:34:28,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:34:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 362 proven. 93 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-11 09:34:30,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:34:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1295380739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:34:31,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:34:31,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 09:34:31,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785135230] [2024-10-11 09:34:31,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:34:31,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:34:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:34:31,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:34:31,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:34:31,859 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 09:34:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:34:33,734 INFO L93 Difference]: Finished difference Result 170 states and 238 transitions. [2024-10-11 09:34:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 09:34:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 136 [2024-10-11 09:34:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:34:33,764 INFO L225 Difference]: With dead ends: 170 [2024-10-11 09:34:33,764 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 09:34:33,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:34:33,766 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 23 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:34:33,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 09:34:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 09:34:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-10-11 09:34:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:34:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2024-10-11 09:34:33,781 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 136 [2024-10-11 09:34:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:34:33,781 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2024-10-11 09:34:33,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 09:34:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2024-10-11 09:34:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:34:33,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:34:33,783 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:34:33,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Forceful destruction successful, exit code 0 [2024-10-11 09:34:33,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-11 09:34:34,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 09:34:34,186 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:34:34,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:34:34,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1124272071, now seen corresponding path program 1 times [2024-10-11 09:34:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:34:34,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214399239] [2024-10-11 09:34:34,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:34:34,187 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-11 09:34:34,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:34:34,190 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 09:34:34,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Waiting until timeout for monitored process [2024-10-11 09:34:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:34:34,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:34:34,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:34:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 350 proven. 15 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2024-10-11 09:34:52,351 INFO L311 TraceCheckSpWp]: Computing backward predicates...