./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/tcpy.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/tcpy.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a747677fdea16741fbb3fca3d9510254677728ef5906b9bf8e219064accd3a39 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:15:20,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:15:20,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:15:20,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:15:20,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:15:20,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:15:21,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:15:21,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:15:21,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:15:21,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:15:21,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:15:21,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:15:21,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:15:21,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:15:21,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:15:21,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:15:21,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:15:21,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:15:21,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:15:21,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:15:21,027 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:15:21,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:15:21,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:15:21,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:15:21,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:15:21,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:15:21,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:15:21,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:15:21,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:15:21,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:15:21,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:15:21,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:15:21,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:15:21,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:15:21,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:15:21,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:15:21,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:15:21,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:15:21,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:15:21,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:15:21,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:15:21,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:15:21,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:15:21,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:15:21,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:15:21,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:15:21,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:15:21,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:15:21,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:15:21,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:15:21,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:15:21,095 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:15:21,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:15:21,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:15:21,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:15:21,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:15:21,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:15:21,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:15:21,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:15:21,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:15:21,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:15:21,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:15:21,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:15:21,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:15:21,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:15:21,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:15:21,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:15:21,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:15:21,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:15:21,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:15:21,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:15:21,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:15:21,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:15:21,100 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:15:21,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:15:21,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:15:21,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a747677fdea16741fbb3fca3d9510254677728ef5906b9bf8e219064accd3a39 [2022-07-20 21:15:21,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:15:21,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:15:21,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:15:21,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:15:21,373 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:15:21,374 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/tcpy.c [2022-07-20 21:15:21,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b104cfe/a4b4f14ebabf48759d9e675a0e66ddd4/FLAG593bf4ea3 [2022-07-20 21:15:21,782 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:15:21,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/tcpy.c [2022-07-20 21:15:21,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b104cfe/a4b4f14ebabf48759d9e675a0e66ddd4/FLAG593bf4ea3 [2022-07-20 21:15:21,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b104cfe/a4b4f14ebabf48759d9e675a0e66ddd4 [2022-07-20 21:15:21,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:15:21,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:15:21,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:15:21,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:15:21,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:15:21,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:15:21" (1/1) ... [2022-07-20 21:15:21,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fece5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:21, skipping insertion in model container [2022-07-20 21:15:21,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:15:21" (1/1) ... [2022-07-20 21:15:21,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:15:21,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:15:21,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/tcpy.c[395,408] [2022-07-20 21:15:21,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:15:21,996 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:15:22,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/tcpy.c[395,408] [2022-07-20 21:15:22,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:15:22,028 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:15:22,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22 WrapperNode [2022-07-20 21:15:22,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:15:22,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:15:22,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:15:22,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:15:22,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,081 INFO L137 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2022-07-20 21:15:22,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:15:22,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:15:22,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:15:22,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:15:22,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:15:22,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:15:22,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:15:22,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:15:22,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (1/1) ... [2022-07-20 21:15:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:15:22,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:15:22,152 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-07-20 21:15:22,175 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-07-20 21:15:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:15:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:15:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:15:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 21:15:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:15:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:15:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:15:22,239 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:15:22,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:15:22,359 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:15:22,364 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:15:22,364 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:15:22,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:15:22 BoogieIcfgContainer [2022-07-20 21:15:22,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:15:22,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:15:22,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:15:22,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:15:22,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:15:21" (1/3) ... [2022-07-20 21:15:22,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b34626b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:15:22, skipping insertion in model container [2022-07-20 21:15:22,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:22" (2/3) ... [2022-07-20 21:15:22,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b34626b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:15:22, skipping insertion in model container [2022-07-20 21:15:22,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:15:22" (3/3) ... [2022-07-20 21:15:22,388 INFO L111 eAbstractionObserver]: Analyzing ICFG tcpy.c [2022-07-20 21:15:22,399 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:15:22,399 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:15:22,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:15:22,457 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7040bab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d873200 [2022-07-20 21:15:22,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:15:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 21:15:22,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:22,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:22,472 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1608152958, now seen corresponding path program 1 times [2022-07-20 21:15:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:15:22,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702916741] [2022-07-20 21:15:22,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:15:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:15:22,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702916741] [2022-07-20 21:15:22,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702916741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:15:22,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:15:22,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:15:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973737061] [2022-07-20 21:15:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:15:22,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:15:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:15:22,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:15:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:15:22,658 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:22,668 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2022-07-20 21:15:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:15:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 21:15:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:22,677 INFO L225 Difference]: With dead ends: 37 [2022-07-20 21:15:22,677 INFO L226 Difference]: Without dead ends: 17 [2022-07-20 21:15:22,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-07-20 21:15:22,688 INFO L413 NwaCegarLoop]: 25 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, 25 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-07-20 21:15:22,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:15:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-20 21:15:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-20 21:15:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-20 21:15:22,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-07-20 21:15:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:22,712 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-20 21:15:22,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-20 21:15:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 21:15:22,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:22,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:22,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:15:22,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1873320706, now seen corresponding path program 1 times [2022-07-20 21:15:22,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:15:22,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486028461] [2022-07-20 21:15:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:15:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:22,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:15:22,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486028461] [2022-07-20 21:15:22,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486028461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:15:22,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:15:22,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:15:22,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216429934] [2022-07-20 21:15:22,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:15:22,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:15:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:15:22,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:15:22,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:15:22,798 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:22,835 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-07-20 21:15:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:15:22,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 21:15:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:22,837 INFO L225 Difference]: With dead ends: 31 [2022-07-20 21:15:22,837 INFO L226 Difference]: Without dead ends: 19 [2022-07-20 21:15:22,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07-20 21:15:22,838 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:15:22,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:15:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-20 21:15:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-20 21:15:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-20 21:15:22,843 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-07-20 21:15:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:22,843 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-20 21:15:22,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-20 21:15:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 21:15:22,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:22,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:22,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 21:15:22,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash -270521828, now seen corresponding path program 1 times [2022-07-20 21:15:22,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:15:22,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684380011] [2022-07-20 21:15:22,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:22,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:15:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:15:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684380011] [2022-07-20 21:15:22,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684380011] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:15:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86632806] [2022-07-20 21:15:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:15:22,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:15:22,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:15:22,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 21:15:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:23,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:15:23,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:15:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:23,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:15:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:23,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86632806] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:15:23,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:15:23,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-20 21:15:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343783178] [2022-07-20 21:15:23,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:15:23,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 21:15:23,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:15:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 21:15:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-20 21:15:23,104 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:23,149 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-07-20 21:15:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:15:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 21:15:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:23,150 INFO L225 Difference]: With dead ends: 33 [2022-07-20 21:15:23,150 INFO L226 Difference]: Without dead ends: 21 [2022-07-20 21:15:23,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-20 21:15:23,151 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:15:23,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:15:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-20 21:15:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-20 21:15:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-20 21:15:23,156 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2022-07-20 21:15:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:23,156 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-20 21:15:23,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-20 21:15:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 21:15:23,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:23,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:23,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 21:15:23,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:15:23,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1874059334, now seen corresponding path program 2 times [2022-07-20 21:15:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:15:23,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863270927] [2022-07-20 21:15:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:15:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 21:15:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:15:23,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863270927] [2022-07-20 21:15:23,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863270927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:15:23,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:15:23,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 21:15:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647778308] [2022-07-20 21:15:23,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:15:23,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 21:15:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:15:23,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 21:15:23,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:15:23,576 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:23,623 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-07-20 21:15:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:15:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 21:15:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:23,624 INFO L225 Difference]: With dead ends: 35 [2022-07-20 21:15:23,624 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 21:15:23,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:15:23,633 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:15:23,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 17 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:15:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 21:15:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2022-07-20 21:15:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-07-20 21:15:23,638 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2022-07-20 21:15:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:23,638 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-20 21:15:23,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-07-20 21:15:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 21:15:23,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:23,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:23,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 21:15:23,640 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash 265660728, now seen corresponding path program 1 times [2022-07-20 21:15:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:15:23,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827660668] [2022-07-20 21:15:23,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:15:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 21:15:23,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:15:23,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827660668] [2022-07-20 21:15:23,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827660668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:15:23,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494648228] [2022-07-20 21:15:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:23,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:15:23,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:15:23,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:15:23,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 21:15:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:23,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 21:15:23,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:15:24,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 21:15:24,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:15:24,127 INFO L356 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-07-20 21:15:24,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 33 [2022-07-20 21:15:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 21:15:24,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:15:24,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:15:24,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 450 [2022-07-20 21:15:24,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 184 [2022-07-20 21:15:35,409 INFO L356 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-07-20 21:15:35,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 77 [2022-07-20 21:15:35,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:15:35,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 690 treesize of output 652 [2022-07-20 21:15:35,942 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 21:15:35,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 343 [2022-07-20 21:15:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 21:15:36,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494648228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:15:36,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:15:36,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-07-20 21:15:36,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506318840] [2022-07-20 21:15:36,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:15:36,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 21:15:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:15:36,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 21:15:36,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-20 21:15:36,019 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:36,110 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-07-20 21:15:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 21:15:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 21:15:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:36,111 INFO L225 Difference]: With dead ends: 29 [2022-07-20 21:15:36,111 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:15:36,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-07-20 21:15:36,112 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:15:36,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 67 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:15:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:15:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-20 21:15:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-20 21:15:36,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2022-07-20 21:15:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:36,116 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-20 21:15:36,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-20 21:15:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 21:15:36,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:36,117 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:36,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 21:15:36,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:15:36,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1994055598, now seen corresponding path program 1 times [2022-07-20 21:15:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:15:36,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501002286] [2022-07-20 21:15:36,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:36,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:15:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:15:36,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501002286] [2022-07-20 21:15:36,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501002286] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:15:36,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740558880] [2022-07-20 21:15:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:36,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:15:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:15:36,671 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:15:36,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 21:15:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:36,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-20 21:15:36,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:15:36,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 21:15:36,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 21:15:36,865 INFO L356 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-07-20 21:15:36,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-07-20 21:15:37,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:15:37,031 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-20 21:15:37,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 23 [2022-07-20 21:15:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:37,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:15:39,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_103 Int) (|ULTIMATE.start_main_~acopy~0#1.offset| Int)) (let ((.cse0 (store (let ((.cse1 (* (- 4) |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (* 4 c_~SIZE~0))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~acopy~0#1.base|) (+ .cse1 (- 4) .cse2 |ULTIMATE.start_main_~acopy~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 (- 4) .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~acopy~0#1.offset|) v_ArrVal_103))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~acopy~0#1.base| .cse0) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (select .cse0 (+ |ULTIMATE.start_main_~acopy~0#1.offset| 4))))) is different from false [2022-07-20 21:15:39,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_103 Int) (|ULTIMATE.start_main_~acopy~0#1.offset| Int)) (let ((.cse0 (let ((.cse1 (* 4 c_~SIZE~0))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~acopy~0#1.base|) (+ (- 4) .cse1 |ULTIMATE.start_main_~acopy~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= (select .cse0 (+ |ULTIMATE.start_main_~acopy~0#1.offset| 4)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~acopy~0#1.base| (store .cse0 |ULTIMATE.start_main_~acopy~0#1.offset| v_ArrVal_103)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-07-20 21:15:41,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:15:41,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 4770 treesize of output 3839 [2022-07-20 21:15:41,746 INFO L356 Elim1Store]: treesize reduction 58, result has 52.5 percent of original size [2022-07-20 21:15:41,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 6191 treesize of output 5617 [2022-07-20 21:15:41,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:15:41,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6363 treesize of output 5919 [2022-07-20 21:15:41,797 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 21:15:41,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 21:15:42,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:15:42,004 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 21:15:42,007 INFO L158 Benchmark]: Toolchain (without parser) took 20206.70ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 74.4MB in the beginning and 108.0MB in the end (delta: -33.7MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2022-07-20 21:15:42,008 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:15:42,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.03ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 78.8MB in the end (delta: -4.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-20 21:15:42,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.55ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 21:15:42,009 INFO L158 Benchmark]: Boogie Preprocessor took 38.51ms. Allocated memory is still 104.9MB. Free memory was 77.1MB in the beginning and 76.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:15:42,010 INFO L158 Benchmark]: RCFGBuilder took 243.09ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 64.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 21:15:42,010 INFO L158 Benchmark]: TraceAbstraction took 19639.98ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 64.5MB in the beginning and 108.0MB in the end (delta: -43.5MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2022-07-20 21:15:42,014 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.20ms. Allocated memory is still 104.9MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.03ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 78.8MB in the end (delta: -4.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.55ms. Allocated memory is still 104.9MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.51ms. Allocated memory is still 104.9MB. Free memory was 77.1MB in the beginning and 76.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 243.09ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 64.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19639.98ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 64.5MB in the beginning and 108.0MB in the end (delta: -43.5MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 21:15:42,033 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/tcpy.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a747677fdea16741fbb3fca3d9510254677728ef5906b9bf8e219064accd3a39 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:15:43,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:15:43,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:15:44,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:15:44,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:15:44,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:15:44,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:15:44,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:15:44,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:15:44,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:15:44,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:15:44,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:15:44,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:15:44,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:15:44,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:15:44,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:15:44,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:15:44,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:15:44,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:15:44,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:15:44,038 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:15:44,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:15:44,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:15:44,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:15:44,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:15:44,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:15:44,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:15:44,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:15:44,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:15:44,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:15:44,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:15:44,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:15:44,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:15:44,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:15:44,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:15:44,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:15:44,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:15:44,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:15:44,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:15:44,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:15:44,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:15:44,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:15:44,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-20 21:15:44,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:15:44,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:15:44,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:15:44,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:15:44,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:15:44,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:15:44,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:15:44,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:15:44,099 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:15:44,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:15:44,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:15:44,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:15:44,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:15:44,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:15:44,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:15:44,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:15:44,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 21:15:44,102 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 21:15:44,102 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 21:15:44,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:15:44,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:15:44,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:15:44,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:15:44,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:15:44,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:15:44,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:15:44,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:15:44,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:15:44,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:15:44,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:15:44,106 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 21:15:44,106 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 21:15:44,106 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:15:44,106 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:15:44,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:15:44,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 21:15:44,107 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a747677fdea16741fbb3fca3d9510254677728ef5906b9bf8e219064accd3a39 [2022-07-20 21:15:44,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:15:44,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:15:44,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:15:44,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:15:44,432 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:15:44,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/tcpy.c [2022-07-20 21:15:44,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b3119e3/3b1766fa1b7b4035845b1e185308b609/FLAG8be94cd47 [2022-07-20 21:15:44,882 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:15:44,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/tcpy.c [2022-07-20 21:15:44,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b3119e3/3b1766fa1b7b4035845b1e185308b609/FLAG8be94cd47 [2022-07-20 21:15:45,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b3119e3/3b1766fa1b7b4035845b1e185308b609 [2022-07-20 21:15:45,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:15:45,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:15:45,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:15:45,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:15:45,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:15:45,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f54be61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45, skipping insertion in model container [2022-07-20 21:15:45,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:15:45,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:15:45,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/tcpy.c[395,408] [2022-07-20 21:15:45,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:15:45,473 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:15:45,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/tcpy.c[395,408] [2022-07-20 21:15:45,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:15:45,534 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:15:45,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45 WrapperNode [2022-07-20 21:15:45,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:15:45,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:15:45,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:15:45,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:15:45,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,571 INFO L137 Inliner]: procedures = 18, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-07-20 21:15:45,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:15:45,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:15:45,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:15:45,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:15:45,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:15:45,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:15:45,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:15:45,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:15:45,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (1/1) ... [2022-07-20 21:15:45,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:15:45,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:15:45,620 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-07-20 21:15:45,627 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-07-20 21:15:45,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:15:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 21:15:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 21:15:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 21:15:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:15:45,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:15:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 21:15:45,706 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:15:45,708 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:15:45,996 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:15:46,001 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:15:46,001 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:15:46,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:15:46 BoogieIcfgContainer [2022-07-20 21:15:46,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:15:46,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:15:46,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:15:46,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:15:46,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:15:45" (1/3) ... [2022-07-20 21:15:46,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb001eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:15:46, skipping insertion in model container [2022-07-20 21:15:46,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:15:45" (2/3) ... [2022-07-20 21:15:46,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb001eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:15:46, skipping insertion in model container [2022-07-20 21:15:46,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:15:46" (3/3) ... [2022-07-20 21:15:46,014 INFO L111 eAbstractionObserver]: Analyzing ICFG tcpy.c [2022-07-20 21:15:46,026 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:15:46,026 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:15:46,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:15:46,107 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b77f31d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70482ff8 [2022-07-20 21:15:46,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:15:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 21:15:46,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:46,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:46,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1608152958, now seen corresponding path program 1 times [2022-07-20 21:15:46,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:15:46,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82362765] [2022-07-20 21:15:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:46,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:15:46,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:15:46,143 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-07-20 21:15:46,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 21:15:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-20 21:15:46,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:15:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:46,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:15:46,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:15:46,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82362765] [2022-07-20 21:15:46,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82362765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:15:46,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:15:46,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:15:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803533040] [2022-07-20 21:15:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:15:46,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:15:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:15:46,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:15:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:15:46,333 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:46,347 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2022-07-20 21:15:46,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:15:46,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 21:15:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:46,355 INFO L225 Difference]: With dead ends: 37 [2022-07-20 21:15:46,355 INFO L226 Difference]: Without dead ends: 17 [2022-07-20 21:15:46,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-07-20 21:15:46,361 INFO L413 NwaCegarLoop]: 25 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, 25 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-07-20 21:15:46,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:15:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-20 21:15:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-20 21:15:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-20 21:15:46,389 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-07-20 21:15:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:46,390 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-20 21:15:46,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-20 21:15:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 21:15:46,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:46,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:46,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 21:15:46,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:15:46,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:46,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1873320706, now seen corresponding path program 1 times [2022-07-20 21:15:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:15:46,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113191741] [2022-07-20 21:15:46,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:46,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:15:46,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:15:46,606 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-07-20 21:15:46,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 21:15:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:46,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 21:15:46,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:15:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:46,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:15:46,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:15:46,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113191741] [2022-07-20 21:15:46,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113191741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:15:46,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:15:46,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:15:46,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260354047] [2022-07-20 21:15:46,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:15:46,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:15:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:15:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:15:46,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:15:46,777 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:46,917 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-07-20 21:15:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:15:46,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 21:15:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:46,919 INFO L225 Difference]: With dead ends: 31 [2022-07-20 21:15:46,919 INFO L226 Difference]: Without dead ends: 19 [2022-07-20 21:15:46,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:15:46,920 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:15:46,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:15:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-20 21:15:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-20 21:15:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-20 21:15:46,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-07-20 21:15:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:46,927 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-20 21:15:46,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-20 21:15:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 21:15:46,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:46,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:46,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 21:15:47,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:15:47,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -270521828, now seen corresponding path program 1 times [2022-07-20 21:15:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:15:47,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853163593] [2022-07-20 21:15:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:15:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:15:47,140 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-07-20 21:15:47,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 21:15:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:47,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 21:15:47,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:15:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:47,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:15:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:15:47,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:15:47,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853163593] [2022-07-20 21:15:47,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853163593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:15:47,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:15:47,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-20 21:15:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135016343] [2022-07-20 21:15:47,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:15:47,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 21:15:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:15:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 21:15:47,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 21:15:47,348 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:47,510 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-07-20 21:15:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 21:15:47,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 21:15:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:47,511 INFO L225 Difference]: With dead ends: 33 [2022-07-20 21:15:47,511 INFO L226 Difference]: Without dead ends: 21 [2022-07-20 21:15:47,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-20 21:15:47,512 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:15:47,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:15:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-20 21:15:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-20 21:15:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-20 21:15:47,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2022-07-20 21:15:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:47,521 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-20 21:15:47,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-20 21:15:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 21:15:47,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:47,522 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:47,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 21:15:47,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:15:47,723 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1874059334, now seen corresponding path program 2 times [2022-07-20 21:15:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:15:47,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548512384] [2022-07-20 21:15:47,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:15:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:15:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:15:47,726 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-07-20 21:15:47,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 21:15:47,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 21:15:47,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:15:47,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 21:15:47,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:15:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 21:15:47,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:15:47,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:15:47,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548512384] [2022-07-20 21:15:47,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548512384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:15:47,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:15:47,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:15:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726818112] [2022-07-20 21:15:47,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:15:47,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 21:15:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:15:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 21:15:47,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:15:47,857 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:15:47,988 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-07-20 21:15:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:15:47,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 21:15:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:15:47,989 INFO L225 Difference]: With dead ends: 35 [2022-07-20 21:15:47,989 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 21:15:47,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 21:15:47,990 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:15:47,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 14 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:15:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 21:15:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2022-07-20 21:15:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-07-20 21:15:47,995 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2022-07-20 21:15:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:15:47,995 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-20 21:15:47,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:15:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-07-20 21:15:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 21:15:47,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:15:47,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:15:48,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-20 21:15:48,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:15:48,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:15:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:15:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash 265660728, now seen corresponding path program 1 times [2022-07-20 21:15:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:15:48,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850341000] [2022-07-20 21:15:48,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:15:48,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:15:48,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:15:48,207 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-07-20 21:15:48,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 21:15:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:15:48,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 21:15:48,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:15:48,435 INFO L356 Elim1Store]: treesize reduction 113, result has 29.8 percent of original size [2022-07-20 21:15:48,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 88 [2022-07-20 21:15:48,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 21:15:48,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2022-07-20 21:15:48,639 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 21:15:48,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 41 [2022-07-20 21:15:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 21:15:48,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:15:48,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:15:48,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 776 treesize of output 730 [2022-07-20 21:15:48,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 190 [2022-07-20 21:18:37,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:18:37,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2194 treesize of output 1954 [2022-07-20 21:18:52,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 466 treesize of output 458 [2022-07-20 21:18:52,132 INFO L356 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-07-20 21:18:52,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 390 treesize of output 331 [2022-07-20 21:18:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 21:18:52,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:18:52,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850341000] [2022-07-20 21:18:52,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850341000] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:18:52,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:18:52,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-20 21:18:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853204064] [2022-07-20 21:18:52,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:18:52,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 21:18:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:18:52,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 21:18:52,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-20 21:18:52,244 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:18:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:18:52,365 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-07-20 21:18:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 21:18:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 21:18:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:18:52,366 INFO L225 Difference]: With dead ends: 32 [2022-07-20 21:18:52,366 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 21:18:52,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-20 21:18:52,367 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:18:52,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-07-20 21:18:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 21:18:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-07-20 21:18:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:18:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-20 21:18:52,371 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-07-20 21:18:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:18:52,372 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-20 21:18:52,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:18:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-20 21:18:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 21:18:52,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:18:52,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:18:52,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 21:18:52,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:18:52,574 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:18:52,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:18:52,574 INFO L85 PathProgramCache]: Analyzing trace with hash -752694474, now seen corresponding path program 2 times [2022-07-20 21:18:52,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:18:52,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046405593] [2022-07-20 21:18:52,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:18:52,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:18:52,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:18:52,576 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-07-20 21:18:52,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 21:18:52,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:18:52,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:18:52,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 21:18:52,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:18:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:18:52,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:18:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:18:55,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:18:55,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046405593] [2022-07-20 21:18:55,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046405593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:18:55,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:18:55,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2022-07-20 21:18:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266912667] [2022-07-20 21:18:55,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:18:55,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 21:18:55,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:18:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 21:18:55,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:18:55,079 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:18:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:18:59,094 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-07-20 21:18:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 21:18:59,095 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 21:18:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:18:59,096 INFO L225 Difference]: With dead ends: 91 [2022-07-20 21:18:59,096 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 21:18:59,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 21:18:59,098 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 182 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 21:18:59,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 90 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-20 21:18:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 21:18:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2022-07-20 21:18:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:18:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-07-20 21:18:59,106 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2022-07-20 21:18:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:18:59,107 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-07-20 21:18:59,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:18:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-07-20 21:18:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 21:18:59,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:18:59,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:18:59,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 21:18:59,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:18:59,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:18:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:18:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1994055598, now seen corresponding path program 1 times [2022-07-20 21:18:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:18:59,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788359447] [2022-07-20 21:18:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:18:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:18:59,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:18:59,324 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-07-20 21:18:59,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 21:18:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:18:59,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 21:18:59,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:18:59,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 21:18:59,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:18:59,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:18:59,560 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-07-20 21:18:59,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-07-20 21:18:59,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:18:59,779 INFO L356 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2022-07-20 21:18:59,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 26 [2022-07-20 21:18:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:18:59,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:19:01,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~acopy~0#1.base| (_ BitVec 32)) (v_ArrVal_79 (_ BitVec 32))) (let ((.cse0 (store (let ((.cse1 (bvmul (_ bv4 32) (bvneg |c_ULTIMATE.start_main_~i~0#1|))) (.cse2 (bvmul (_ bv4 32) c_~SIZE~0))) (store (select |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~acopy~0#1.offset| .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1 .cse2)))) (bvadd |c_ULTIMATE.start_main_~acopy~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) v_ArrVal_79))) (= (select .cse0 (bvadd |c_ULTIMATE.start_main_~acopy~0#1.offset| (_ bv4 32))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base| .cse0) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-20 21:19:03,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~acopy~0#1.base| (_ BitVec 32)) (v_ArrVal_79 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (bvmul (_ bv4 32) c_~SIZE~0))) (store (select |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~acopy~0#1.offset| .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)))))) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~acopy~0#1.offset| v_ArrVal_79)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse0 (bvadd |c_ULTIMATE.start_main_~acopy~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-20 21:19:06,046 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~acopy~0#1.base| (_ BitVec 32)) (v_ArrVal_79 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (bvmul (_ bv4 32) c_~SIZE~0))) (store (select |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~acopy~0#1.offset| .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)))))) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~acopy~0#1.offset| v_ArrVal_79)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse0 (bvadd |c_ULTIMATE.start_main_~acopy~0#1.offset| (_ bv4 32)))))) (not (= (bvsrem c_~SIZE~0 (_ bv2 32)) (_ bv0 32)))) is different from false [2022-07-20 21:19:10,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 170 [2022-07-20 21:19:10,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:19:10,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 623 treesize of output 517 [2022-07-20 21:19:10,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:19:10,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 206 [2022-07-20 21:19:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 21:19:16,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:19:16,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788359447] [2022-07-20 21:19:16,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788359447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:19:16,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:19:16,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2022-07-20 21:19:16,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608438929] [2022-07-20 21:19:16,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:19:16,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 21:19:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:19:16,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 21:19:16,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=314, Unknown=5, NotChecked=114, Total=506 [2022-07-20 21:19:16,864 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:19:18,994 WARN L833 $PredicateComparison]: unable to prove that (and (bvsgt c_~SIZE~0 (_ bv1 32)) (= (_ bv0 32) (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~acopy~0#1.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) c_~SIZE~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (or (forall ((|ULTIMATE.start_main_~acopy~0#1.base| (_ BitVec 32)) (v_ArrVal_79 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (bvmul (_ bv4 32) c_~SIZE~0))) (store (select |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~acopy~0#1.offset| .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)))))) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~acopy~0#1.offset| v_ArrVal_79)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse0 (bvadd |c_ULTIMATE.start_main_~acopy~0#1.offset| (_ bv4 32)))))) (not (= (bvsrem c_~SIZE~0 (_ bv2 32)) (_ bv0 32)))) (bvslt c_~SIZE~0 (_ bv100000 32)) (= c_~MAX~0 (_ bv100000 32))) is different from false [2022-07-20 21:19:21,015 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~acopy~0#1.base| (_ BitVec 32)) (v_ArrVal_79 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (bvmul (_ bv4 32) c_~SIZE~0))) (store (select |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~acopy~0#1.offset| .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)))))) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~acopy~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~acopy~0#1.offset| v_ArrVal_79)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select .cse0 (bvadd |c_ULTIMATE.start_main_~acopy~0#1.offset| (_ bv4 32)))))) (bvsgt c_~SIZE~0 (_ bv1 32)) (= |c_ULTIMATE.start_main_~acopy~0#1.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) c_~SIZE~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) is different from false