/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/reducercommutativity/rangesum.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:45:21,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:45:21,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:45:21,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:45:21,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:45:21,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:45:21,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:45:21,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:45:21,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:45:21,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:45:21,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:45:21,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:45:21,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:45:21,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:45:21,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:45:21,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:45:21,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:45:21,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:45:21,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:45:21,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:45:21,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:45:21,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:45:21,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:45:21,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:45:21,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:45:21,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:45:21,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:45:21,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:45:21,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:45:21,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:45:21,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:45:21,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:45:21,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:45:21,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:45:21,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:45:21,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:45:21,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:45:21,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:45:21,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:45:21,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:45:21,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:45:21,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:45:21,186 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:45:21,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:45:21,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:45:21,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:45:21,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:45:21,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:45:21,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:45:21,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:45:21,189 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:45:21,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:45:21,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:45:21,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:45:21,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:45:21,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:45:21,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:45:21,191 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:45:21,191 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:45:21,191 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:45:21,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:45:21,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:45:21,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:45:21,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:45:21,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:45:21,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:45:21,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:45:21,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:45:21,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:45:21,193 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:45:21,194 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:45:21,194 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:45:21,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:45:21,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:45:21,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:45:21,194 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:45:21,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:45:21,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:45:21,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:45:21,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:45:21,442 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:45:21,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum.i [2022-01-10 03:45:21,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de773b8/590d496df4c24c88b406cf73bd6a02f2/FLAG0a5b0f063 [2022-01-10 03:45:21,865 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:45:21,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum.i [2022-01-10 03:45:21,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de773b8/590d496df4c24c88b406cf73bd6a02f2/FLAG0a5b0f063 [2022-01-10 03:45:21,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8de773b8/590d496df4c24c88b406cf73bd6a02f2 [2022-01-10 03:45:21,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:45:21,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:45:21,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:45:21,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:45:21,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:45:21,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:21" (1/1) ... [2022-01-10 03:45:21,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788d4480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:21, skipping insertion in model container [2022-01-10 03:45:21,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:21" (1/1) ... [2022-01-10 03:45:21,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:45:21,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:45:22,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum.i[1544,1557] [2022-01-10 03:45:22,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:45:22,174 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:45:22,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum.i[1544,1557] [2022-01-10 03:45:22,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:45:22,226 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:45:22,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22 WrapperNode [2022-01-10 03:45:22,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:45:22,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:45:22,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:45:22,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:45:22,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,272 INFO L137 Inliner]: procedures = 19, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-01-10 03:45:22,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:45:22,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:45:22,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:45:22,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:45:22,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:45:22,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:45:22,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:45:22,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:45:22,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:45:22,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:45:22,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:45:22,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:45:22,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:45:22,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:45:22,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 03:45:22,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 03:45:22,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:45:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:45:22,384 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2022-01-10 03:45:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2022-01-10 03:45:22,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 03:45:22,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 03:45:22,466 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:45:22,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:45:22,934 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:45:22,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:45:22,939 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 03:45:22,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:22 BoogieIcfgContainer [2022-01-10 03:45:22,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:45:22,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:45:22,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:45:22,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:45:22,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:45:21" (1/3) ... [2022-01-10 03:45:22,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9da399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:22, skipping insertion in model container [2022-01-10 03:45:22,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (2/3) ... [2022-01-10 03:45:22,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9da399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:22, skipping insertion in model container [2022-01-10 03:45:22,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:22" (3/3) ... [2022-01-10 03:45:22,949 INFO L111 eAbstractionObserver]: Analyzing ICFG rangesum.i [2022-01-10 03:45:22,953 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:45:22,953 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:45:23,001 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:45:23,009 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:45:23,009 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:45:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 03:45:23,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:23,030 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:23,031 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2094119026, now seen corresponding path program 1 times [2022-01-10 03:45:23,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:23,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485434072] [2022-01-10 03:45:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:23,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:23,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:23,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:23,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:45:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:23,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:45:23,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 03:45:23,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:23,513 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:23,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485434072] [2022-01-10 03:45:23,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485434072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:23,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:23,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:45:23,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975116172] [2022-01-10 03:45:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:23,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:45:23,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:23,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:45:23,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:45:23,548 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:23,563 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2022-01-10 03:45:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:45:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-01-10 03:45:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:23,571 INFO L225 Difference]: With dead ends: 55 [2022-01-10 03:45:23,571 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 03:45:23,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:45:23,577 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:23,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:45:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 03:45:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 03:45:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-01-10 03:45:23,605 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 30 [2022-01-10 03:45:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:23,606 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-01-10 03:45:23,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-01-10 03:45:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 03:45:23,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:23,608 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:23,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:23,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:23,824 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2142996165, now seen corresponding path program 1 times [2022-01-10 03:45:23,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:23,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293591807] [2022-01-10 03:45:23,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:23,826 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:23,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:23,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:45:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:24,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 03:45:24,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 03:45:24,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:24,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:24,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293591807] [2022-01-10 03:45:24,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293591807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:24,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:24,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:45:24,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775400118] [2022-01-10 03:45:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:24,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:45:24,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:24,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:45:24,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:24,321 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:45:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:24,437 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2022-01-10 03:45:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:45:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-01-10 03:45:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:24,440 INFO L225 Difference]: With dead ends: 49 [2022-01-10 03:45:24,440 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 03:45:24,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:24,441 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:24,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 03:45:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-01-10 03:45:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-01-10 03:45:24,449 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 30 [2022-01-10 03:45:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:24,450 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-01-10 03:45:24,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:45:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-01-10 03:45:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 03:45:24,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:24,451 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:24,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:24,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:24,664 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1650095802, now seen corresponding path program 1 times [2022-01-10 03:45:24,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:24,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508294308] [2022-01-10 03:45:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:24,665 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:24,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:24,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:24,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:45:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:24,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:45:24,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 03:45:25,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:25,015 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:25,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508294308] [2022-01-10 03:45:25,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508294308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:25,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:25,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 03:45:25,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240836203] [2022-01-10 03:45:25,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:25,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 03:45:25,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 03:45:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:45:25,018 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:25,243 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-01-10 03:45:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:45:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-01-10 03:45:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:25,245 INFO L225 Difference]: With dead ends: 55 [2022-01-10 03:45:25,245 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 03:45:25,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:45:25,247 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:25,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 208 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:45:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 03:45:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-01-10 03:45:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:45:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-01-10 03:45:25,256 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 30 [2022-01-10 03:45:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:25,257 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2022-01-10 03:45:25,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-01-10 03:45:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 03:45:25,258 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:25,258 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:25,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:25,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:25,468 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1141234331, now seen corresponding path program 1 times [2022-01-10 03:45:25,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:25,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320105179] [2022-01-10 03:45:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:25,469 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:25,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:25,470 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:25,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:45:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:25,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:45:25,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 03:45:25,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:25,754 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:25,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320105179] [2022-01-10 03:45:25,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320105179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:25,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:25,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:45:25,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827261018] [2022-01-10 03:45:25,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:25,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:45:25,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:25,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:45:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:45:25,756 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:45:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:25,906 INFO L93 Difference]: Finished difference Result 72 states and 108 transitions. [2022-01-10 03:45:25,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:45:25,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-01-10 03:45:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:25,908 INFO L225 Difference]: With dead ends: 72 [2022-01-10 03:45:25,908 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 03:45:25,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:45:25,909 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:25,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 03:45:25,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-01-10 03:45:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:45:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-01-10 03:45:25,917 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 33 [2022-01-10 03:45:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:25,917 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2022-01-10 03:45:25,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:45:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-01-10 03:45:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 03:45:25,919 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:25,919 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:25,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:26,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:26,132 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash -671274477, now seen corresponding path program 1 times [2022-01-10 03:45:26,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:26,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473292264] [2022-01-10 03:45:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:26,133 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:26,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:26,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:26,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:45:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:26,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:45:26,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:45:26,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 03:45:27,574 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:27,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473292264] [2022-01-10 03:45:27,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473292264] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:27,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:27,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2022-01-10 03:45:27,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301111596] [2022-01-10 03:45:27,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:27,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:45:27,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:27,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:45:27,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:45:27,576 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 03:45:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:28,587 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2022-01-10 03:45:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:45:28,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-01-10 03:45:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:28,591 INFO L225 Difference]: With dead ends: 78 [2022-01-10 03:45:28,591 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 03:45:28,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:45:28,593 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:28,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 77 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 03:45:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 03:45:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-01-10 03:45:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:45:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-01-10 03:45:28,599 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 42 [2022-01-10 03:45:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:28,600 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-01-10 03:45:28,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 03:45:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-01-10 03:45:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 03:45:28,601 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:28,601 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:28,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:28,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:28,815 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1381423845, now seen corresponding path program 2 times [2022-01-10 03:45:28,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:28,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314585177] [2022-01-10 03:45:28,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:45:28,816 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:28,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:28,817 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:28,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:45:28,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 03:45:28,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:45:28,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:45:28,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-01-10 03:45:28,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:28,984 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:28,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314585177] [2022-01-10 03:45:28,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314585177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:28,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:28,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:45:28,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941040597] [2022-01-10 03:45:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:28,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:45:28,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:45:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:28,986 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:29,066 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2022-01-10 03:45:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:45:29,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-01-10 03:45:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:29,073 INFO L225 Difference]: With dead ends: 83 [2022-01-10 03:45:29,074 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 03:45:29,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:29,075 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:29,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 03:45:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-01-10 03:45:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:45:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-01-10 03:45:29,086 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 51 [2022-01-10 03:45:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:29,086 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-01-10 03:45:29,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-01-10 03:45:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 03:45:29,088 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:29,089 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:29,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:29,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:29,289 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1526793667, now seen corresponding path program 1 times [2022-01-10 03:45:29,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:29,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196428840] [2022-01-10 03:45:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:29,291 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:29,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:29,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:29,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:45:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:29,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:45:29,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-01-10 03:45:29,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 5 proven. 62 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 03:45:31,805 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:31,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196428840] [2022-01-10 03:45:31,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196428840] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:31,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:31,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 11 [2022-01-10 03:45:31,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087316366] [2022-01-10 03:45:31,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:31,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 03:45:31,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:31,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 03:45:31,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:45:31,807 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 03:45:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:33,956 INFO L93 Difference]: Finished difference Result 125 states and 175 transitions. [2022-01-10 03:45:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:45:33,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2022-01-10 03:45:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:33,963 INFO L225 Difference]: With dead ends: 125 [2022-01-10 03:45:33,963 INFO L226 Difference]: Without dead ends: 87 [2022-01-10 03:45:33,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:45:33,964 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 64 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:33,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 130 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 03:45:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-10 03:45:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 46. [2022-01-10 03:45:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:45:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-01-10 03:45:33,976 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 53 [2022-01-10 03:45:33,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:33,977 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-01-10 03:45:33,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 03:45:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-01-10 03:45:33,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 03:45:33,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:33,978 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:33,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:34,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:34,179 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:34,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:34,179 INFO L85 PathProgramCache]: Analyzing trace with hash 506728159, now seen corresponding path program 2 times [2022-01-10 03:45:34,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:34,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429897013] [2022-01-10 03:45:34,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:45:34,180 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:34,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:34,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:34,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:45:34,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:45:34,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:45:34,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:45:34,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-10 03:45:34,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 5 proven. 65 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 03:45:39,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:39,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429897013] [2022-01-10 03:45:39,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429897013] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:39,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:39,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-01-10 03:45:39,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592780945] [2022-01-10 03:45:39,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:39,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 03:45:39,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:39,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 03:45:39,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-01-10 03:45:39,383 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 03:45:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:44,737 INFO L93 Difference]: Finished difference Result 145 states and 201 transitions. [2022-01-10 03:45:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 03:45:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2022-01-10 03:45:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:44,742 INFO L225 Difference]: With dead ends: 145 [2022-01-10 03:45:44,742 INFO L226 Difference]: Without dead ends: 89 [2022-01-10 03:45:44,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2022-01-10 03:45:44,743 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 89 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:44,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 236 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-10 03:45:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-10 03:45:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2022-01-10 03:45:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:45:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-01-10 03:45:44,758 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 55 [2022-01-10 03:45:44,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:44,758 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2022-01-10 03:45:44,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 03:45:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-01-10 03:45:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 03:45:44,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:44,759 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:44,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 03:45:44,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:44,968 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash 511083265, now seen corresponding path program 3 times [2022-01-10 03:45:44,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:44,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056393018] [2022-01-10 03:45:44,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:45:44,969 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:44,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:44,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:44,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:45:45,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 03:45:45,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:45:45,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:45:45,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-01-10 03:45:45,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:45,197 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:45,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056393018] [2022-01-10 03:45:45,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056393018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:45,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:45,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:45:45,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164804022] [2022-01-10 03:45:45,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:45,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:45:45,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:45:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:45:45,199 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:45:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:45,315 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2022-01-10 03:45:45,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:45:45,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2022-01-10 03:45:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:45,316 INFO L225 Difference]: With dead ends: 78 [2022-01-10 03:45:45,316 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 03:45:45,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:45:45,317 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:45,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 03:45:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-01-10 03:45:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 03:45:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-01-10 03:45:45,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 57 [2022-01-10 03:45:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:45,324 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-01-10 03:45:45,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:45:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-01-10 03:45:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 03:45:45,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:45,326 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:45,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:45,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:45,531 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash 619340959, now seen corresponding path program 1 times [2022-01-10 03:45:45,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:45,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778155608] [2022-01-10 03:45:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:45,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:45,534 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:45,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 03:45:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:45,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 03:45:45,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 62 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 03:45:47,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 32 proven. 29 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-10 03:45:48,381 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:48,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778155608] [2022-01-10 03:45:48,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778155608] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:48,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:48,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2022-01-10 03:45:48,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543781287] [2022-01-10 03:45:48,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:48,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 03:45:48,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 03:45:48,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-01-10 03:45:48,383 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 3 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 03:45:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:50,886 INFO L93 Difference]: Finished difference Result 133 states and 198 transitions. [2022-01-10 03:45:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 03:45:50,889 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 3 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-01-10 03:45:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:50,891 INFO L225 Difference]: With dead ends: 133 [2022-01-10 03:45:50,891 INFO L226 Difference]: Without dead ends: 95 [2022-01-10 03:45:50,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-01-10 03:45:50,892 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 156 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:50,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 152 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 03:45:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-10 03:45:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2022-01-10 03:45:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 9 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2022-01-10 03:45:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2022-01-10 03:45:50,903 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 59 [2022-01-10 03:45:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:50,904 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2022-01-10 03:45:50,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 3 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 03:45:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2022-01-10 03:45:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 03:45:50,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:50,905 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:50,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:51,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:51,106 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:51,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 433918235, now seen corresponding path program 1 times [2022-01-10 03:45:51,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:51,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862130979] [2022-01-10 03:45:51,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:51,107 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:51,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:51,108 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:51,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 03:45:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:51,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 03:45:51,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 77 proven. 49 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-01-10 03:45:53,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-01-10 03:45:54,124 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:54,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862130979] [2022-01-10 03:45:54,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862130979] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:54,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:54,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2022-01-10 03:45:54,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557582023] [2022-01-10 03:45:54,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:54,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 03:45:54,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:54,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 03:45:54,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-01-10 03:45:54,127 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 03:45:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:56,932 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2022-01-10 03:45:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 03:45:56,936 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 65 [2022-01-10 03:45:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:56,938 INFO L225 Difference]: With dead ends: 153 [2022-01-10 03:45:56,938 INFO L226 Difference]: Without dead ends: 103 [2022-01-10 03:45:56,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2022-01-10 03:45:56,939 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 120 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:56,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 122 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 03:45:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-10 03:45:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2022-01-10 03:45:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.15) internal successors, (92), 82 states have internal predecessors, (92), 9 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2022-01-10 03:45:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2022-01-10 03:45:56,952 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 65 [2022-01-10 03:45:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:56,952 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2022-01-10 03:45:56,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 03:45:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2022-01-10 03:45:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 03:45:56,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:56,954 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:56,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:57,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:57,172 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1262430211, now seen corresponding path program 2 times [2022-01-10 03:45:57,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:57,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883223422] [2022-01-10 03:45:57,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:45:57,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:57,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:57,174 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:57,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 03:45:57,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:45:57,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 03:45:57,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 03:45:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 03:45:58,474 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 03:45:58,474 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 03:45:58,475 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:45:58,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:58,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:58,679 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2022-01-10 03:45:58,681 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:45:58,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:45:58 BoogieIcfgContainer [2022-01-10 03:45:58,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:45:58,747 INFO L158 Benchmark]: Toolchain (without parser) took 36850.87ms. Allocated memory was 180.4MB in the beginning and 266.3MB in the end (delta: 86.0MB). Free memory was 126.6MB in the beginning and 238.2MB in the end (delta: -111.7MB). Peak memory consumption was 125.5MB. Max. memory is 8.0GB. [2022-01-10 03:45:58,748 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:45:58,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.91ms. Allocated memory was 180.4MB in the beginning and 266.3MB in the end (delta: 86.0MB). Free memory was 126.3MB in the beginning and 239.1MB in the end (delta: -112.8MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-01-10 03:45:58,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.54ms. Allocated memory is still 266.3MB. Free memory was 238.6MB in the beginning and 237.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:45:58,759 INFO L158 Benchmark]: Boogie Preprocessor took 29.72ms. Allocated memory is still 266.3MB. Free memory was 237.0MB in the beginning and 236.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:45:58,760 INFO L158 Benchmark]: RCFGBuilder took 637.25ms. Allocated memory is still 266.3MB. Free memory was 236.0MB in the beginning and 222.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 03:45:58,760 INFO L158 Benchmark]: TraceAbstraction took 35804.83ms. Allocated memory is still 266.3MB. Free memory was 222.3MB in the beginning and 238.2MB in the end (delta: -15.9MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. [2022-01-10 03:45:58,761 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.91ms. Allocated memory was 180.4MB in the beginning and 266.3MB in the end (delta: 86.0MB). Free memory was 126.3MB in the beginning and 239.1MB in the end (delta: -112.8MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.54ms. Allocated memory is still 266.3MB. Free memory was 238.6MB in the beginning and 237.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.72ms. Allocated memory is still 266.3MB. Free memory was 237.0MB in the beginning and 236.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 637.25ms. Allocated memory is still 266.3MB. Free memory was 236.0MB in the beginning and 222.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 35804.83ms. Allocated memory is still 266.3MB. Free memory was 222.3MB in the beginning and 238.2MB in the end (delta: -15.9MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 64]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] int N; VAL [N=0] [L43] N = __VERIFIER_nondet_int() [L44] COND TRUE N > 1 [L45] int x[N]; [L46] CALL init_nondet(x) [L17] int i; [L18] i = 0 VAL [i=0, N=3, x={3:0}, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [i=1, N=3, x={3:0}, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [i=2, N=3, x={3:0}, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [i=3, N=3, x={3:0}, x={3:0}] [L18] COND FALSE !(i < N) VAL [i=3, N=3, x={3:0}, x={3:0}] [L46] RET init_nondet(x) [L47] int temp; [L48] int ret; [L49] int ret2; [L50] int ret5; VAL [N=3, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [N=3, x={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [cnt=0, i=0, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i < N VAL [cnt=0, i=0, N=3, ret=0, x={3:0}, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [cnt=0, i=0, N=3, ret=0, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i < N VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=0, i=2, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i < N VAL [cnt=0, i=2, N=3, ret=0, x={3:0}, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [cnt=1, i=2, N=3, ret=18446744071562067968, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=1, i=3, N=3, ret=18446744071562067968, x={3:0}, x={3:0}] [L29] COND FALSE !(i < N) VAL [cnt=1, i=3, N=3, ret=18446744071562067968, x={3:0}, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [\result=-2147483648, cnt=1, i=3, N=3, ret=18446744071562067968, x={3:0}, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [N=3, rangesum(x)=-2147483648, x={3:0}] [L52] ret = rangesum(x) [L54] EXPR x[0] [L54] temp=x[0] [L54] EXPR x[1] [L54] x[0] = x[1] [L54] x[1] = temp VAL [N=3, ret=2147483648, temp=0, x={3:0}] [L55] CALL, EXPR rangesum(x) VAL [N=3, x={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [cnt=0, i=0, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i < N VAL [cnt=0, i=0, N=3, ret=0, x={3:0}, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [cnt=0, i=0, N=3, ret=0, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i < N VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=0, i=2, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i < N VAL [cnt=0, i=2, N=3, ret=0, x={3:0}, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [cnt=1, i=2, N=3, ret=18446744071562067968, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=1, i=3, N=3, ret=18446744071562067968, x={3:0}, x={3:0}] [L29] COND FALSE !(i < N) VAL [cnt=1, i=3, N=3, ret=18446744071562067968, x={3:0}, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [\result=-2147483648, cnt=1, i=3, N=3, ret=18446744071562067968, x={3:0}, x={3:0}] [L55] RET, EXPR rangesum(x) VAL [N=3, rangesum(x)=-2147483648, ret=2147483648, temp=0, x={3:0}] [L55] ret2 = rangesum(x) [L56] EXPR x[0] [L56] temp=x[0] [L57] int i =0 ; VAL [i=0, N=3, ret=2147483648, ret2=2147483648, temp=0, x={3:0}] [L57] COND TRUE i N/2) VAL [cnt=0, i=0, N=3, ret=0, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i < N VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [cnt=0, i=1, N=3, ret=0, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=0, i=2, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i < N VAL [cnt=0, i=2, N=3, ret=0, x={3:0}, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [cnt=1, i=2, N=3, ret=0, x={3:0}, x={3:0}] [L29] i++ VAL [cnt=1, i=3, N=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i < N) VAL [cnt=1, i=3, N=3, ret=0, x={3:0}, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [\result=0, cnt=1, i=3, N=3, ret=0, x={3:0}, x={3:0}] [L61] RET, EXPR rangesum(x) VAL [i=2, N=3, rangesum(x)=0, ret=2147483648, ret2=2147483648, temp=0, x={3:0}] [L61] ret5 = rangesum(x) [L63] COND TRUE ret != ret2 || ret !=ret5 VAL [i=2, N=3, ret=2147483648, ret2=2147483648, ret5=0, temp=0, x={3:0}] [L64] reach_error() VAL [i=2, N=3, ret=2147483648, ret2=2147483648, ret5=0, temp=0, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.7s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 1130 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 834 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1815 IncrementalHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 296 mSDtfsCounter, 1815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 786 GetRequests, 685 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=11, InterpolantAutomatonStates: 99, 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, 11 MinimizatonAttempts, 121 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 572 NumberOfCodeBlocks, 506 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 763 ConstructedInterpolants, 0 QuantifiedInterpolants, 2397 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1091 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 1016/1304 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 proved your program to be incorrect! [2022-01-10 03:45:58,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...