./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/loops/eureka_01-1.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 a0175e46c372a5de5baa3319396a86b21fa2d79f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 10:21:38,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 10:21:38,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 10:21:38,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 10:21:38,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 10:21:38,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 10:21:38,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 10:21:38,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 10:21:38,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 10:21:38,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 10:21:38,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 10:21:38,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 10:21:38,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 10:21:38,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 10:21:38,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 10:21:38,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 10:21:38,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 10:21:38,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 10:21:38,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 10:21:38,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 10:21:38,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 10:21:38,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 10:21:38,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 10:21:38,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 10:21:38,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 10:21:38,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 10:21:38,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 10:21:38,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 10:21:38,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 10:21:38,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 10:21:38,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 10:21:38,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 10:21:38,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 10:21:38,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 10:21:38,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 10:21:38,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 10:21:38,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 10:21:38,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 10:21:38,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 10:21:38,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 10:21:38,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 10:21:38,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 10:21:38,093 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 10:21:38,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 10:21:38,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 10:21:38,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 10:21:38,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 10:21:38,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 10:21:38,095 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 10:21:38,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 10:21:38,096 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 10:21:38,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 10:21:38,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 10:21:38,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 10:21:38,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 10:21:38,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 10:21:38,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 10:21:38,097 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 10:21:38,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 10:21:38,098 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 10:21:38,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 10:21:38,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 10:21:38,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 10:21:38,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 10:21:38,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 10:21:38,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 10:21:38,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 10:21:38,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 10:21:38,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 10:21:38,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 10:21:38,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 10:21:38,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 10:21:38,100 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 -> a0175e46c372a5de5baa3319396a86b21fa2d79f [2021-08-29 10:21:38,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 10:21:38,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 10:21:38,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 10:21:38,440 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 10:21:38,441 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 10:21:38,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_01-1.c [2021-08-29 10:21:38,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40d3f388/808b88bfd0da4f0d9f502931b11cab45/FLAG76a233c11 [2021-08-29 10:21:38,959 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 10:21:38,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c [2021-08-29 10:21:38,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40d3f388/808b88bfd0da4f0d9f502931b11cab45/FLAG76a233c11 [2021-08-29 10:21:39,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40d3f388/808b88bfd0da4f0d9f502931b11cab45 [2021-08-29 10:21:39,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 10:21:39,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 10:21:39,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 10:21:39,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 10:21:39,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 10:21:39,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179fec21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39, skipping insertion in model container [2021-08-29 10:21:39,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 10:21:39,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 10:21:39,477 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c[446,459] [2021-08-29 10:21:39,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 10:21:39,508 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 10:21:39,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c[446,459] [2021-08-29 10:21:39,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 10:21:39,606 INFO L208 MainTranslator]: Completed translation [2021-08-29 10:21:39,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39 WrapperNode [2021-08-29 10:21:39,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 10:21:39,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 10:21:39,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 10:21:39,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 10:21:39,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 10:21:39,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 10:21:39,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 10:21:39,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 10:21:39,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 10:21:39,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 10:21:39,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 10:21:39,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 10:21:39,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (1/1) ... [2021-08-29 10:21:39,675 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 10:21:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:39,694 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) [2021-08-29 10:21:39,718 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 [2021-08-29 10:21:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 10:21:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 10:21:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 10:21:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 10:21:39,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 10:21:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-29 10:21:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 10:21:39,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 10:21:39,990 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-08-29 10:21:39,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:21:39 BoogieIcfgContainer [2021-08-29 10:21:39,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 10:21:39,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 10:21:39,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 10:21:39,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 10:21:39,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:21:39" (1/3) ... [2021-08-29 10:21:39,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a78530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:21:39, skipping insertion in model container [2021-08-29 10:21:39,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:21:39" (2/3) ... [2021-08-29 10:21:39,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a78530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:21:39, skipping insertion in model container [2021-08-29 10:21:39,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:21:39" (3/3) ... [2021-08-29 10:21:39,998 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2021-08-29 10:21:40,003 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 10:21:40,003 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 10:21:40,056 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 10:21:40,063 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 10:21:40,064 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 10:21:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 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) [2021-08-29 10:21:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 10:21:40,092 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:40,093 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:40,094 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:40,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2021-08-29 10:21:40,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:40,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899826136] [2021-08-29 10:21:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:40,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 10:21:40,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:40,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899826136] [2021-08-29 10:21:40,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899826136] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 10:21:40,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 10:21:40,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 10:21:40,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634854118] [2021-08-29 10:21:40,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 10:21:40,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 10:21:40,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 10:21:40,506 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 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) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2021-08-29 10:21:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:40,715 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2021-08-29 10:21:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 10:21:40,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2021-08-29 10:21:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:40,723 INFO L225 Difference]: With dead ends: 89 [2021-08-29 10:21:40,723 INFO L226 Difference]: Without dead ends: 42 [2021-08-29 10:21:40,725 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 10:21:40,728 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 147.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.07ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 178.77ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:40,730 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 2.07ms Time], IncrementalHoareTripleChecker [17 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 178.77ms Time] [2021-08-29 10:21:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-29 10:21:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2021-08-29 10:21:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 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) [2021-08-29 10:21:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-08-29 10:21:40,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2021-08-29 10:21:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:40,761 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-08-29 10:21:40,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2021-08-29 10:21:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-08-29 10:21:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-29 10:21:40,762 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:40,762 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:40,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 10:21:40,763 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2021-08-29 10:21:40,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:40,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479214595] [2021-08-29 10:21:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:40,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:41,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:41,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479214595] [2021-08-29 10:21:41,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479214595] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:41,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777709011] [2021-08-29 10:21:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:41,013 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:41,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:41,020 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) [2021-08-29 10:21:41,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-29 10:21:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:41,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-29 10:21:41,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:41,218 INFO L388 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 18 treesize of output 14 [2021-08-29 10:21:41,333 INFO L388 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 33 treesize of output 25 [2021-08-29 10:21:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:41,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:41,429 INFO L388 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 14 treesize of output 12 [2021-08-29 10:21:41,432 INFO L388 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 22 treesize of output 20 [2021-08-29 10:21:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:41,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777709011] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:21:41,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:21:41,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-08-29 10:21:41,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260004106] [2021-08-29 10:21:41,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 10:21:41,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 10:21:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-29 10:21:41,453 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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) [2021-08-29 10:21:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:41,742 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2021-08-29 10:21:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 10:21:41,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 19 [2021-08-29 10:21:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:41,747 INFO L225 Difference]: With dead ends: 84 [2021-08-29 10:21:41,747 INFO L226 Difference]: Without dead ends: 82 [2021-08-29 10:21:41,749 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 92.60ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-29 10:21:41,751 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 174.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.26ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 226.20ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:41,752 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 295 Unknown, 0 Unchecked, 4.26ms Time], IncrementalHoareTripleChecker [27 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 226.20ms Time] [2021-08-29 10:21:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-08-29 10:21:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2021-08-29 10:21:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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) [2021-08-29 10:21:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2021-08-29 10:21:41,772 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2021-08-29 10:21:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:41,772 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2021-08-29 10:21:41,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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) [2021-08-29 10:21:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2021-08-29 10:21:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-29 10:21:41,773 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:41,774 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:41,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:41,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:41,975 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2021-08-29 10:21:41,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:41,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083112945] [2021-08-29 10:21:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:41,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:42,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:42,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083112945] [2021-08-29 10:21:42,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083112945] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 10:21:42,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 10:21:42,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 10:21:42,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063144612] [2021-08-29 10:21:42,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 10:21:42,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:42,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 10:21:42,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 10:21:42,019 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2021-08-29 10:21:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:42,098 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2021-08-29 10:21:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 10:21:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2021-08-29 10:21:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:42,099 INFO L225 Difference]: With dead ends: 66 [2021-08-29 10:21:42,099 INFO L226 Difference]: Without dead ends: 45 [2021-08-29 10:21:42,100 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.71ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 10:21:42,101 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.30ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.51ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:42,101 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.30ms Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 65.51ms Time] [2021-08-29 10:21:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-08-29 10:21:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-08-29 10:21:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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) [2021-08-29 10:21:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2021-08-29 10:21:42,106 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2021-08-29 10:21:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:42,106 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2021-08-29 10:21:42,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-08-29 10:21:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2021-08-29 10:21:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-29 10:21:42,107 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:42,107 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:42,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 10:21:42,108 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2021-08-29 10:21:42,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:42,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451471593] [2021-08-29 10:21:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:42,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:42,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:42,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451471593] [2021-08-29 10:21:42,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451471593] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:42,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980650294] [2021-08-29 10:21:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:42,161 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:42,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:42,163 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) [2021-08-29 10:21:42,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-29 10:21:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:42,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-29 10:21:42,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:42,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:42,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980650294] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:21:42,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:21:42,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-08-29 10:21:42,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464306325] [2021-08-29 10:21:42,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 10:21:42,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 10:21:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-29 10:21:42,405 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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) [2021-08-29 10:21:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:42,615 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2021-08-29 10:21:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 10:21:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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) Word has length 22 [2021-08-29 10:21:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:42,620 INFO L225 Difference]: With dead ends: 114 [2021-08-29 10:21:42,620 INFO L226 Difference]: Without dead ends: 86 [2021-08-29 10:21:42,621 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 57.33ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-29 10:21:42,624 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 127.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.22ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 163.16ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:42,625 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 312 Unknown, 0 Unchecked, 4.22ms Time], IncrementalHoareTripleChecker [14 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 163.16ms Time] [2021-08-29 10:21:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-08-29 10:21:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2021-08-29 10:21:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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) [2021-08-29 10:21:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2021-08-29 10:21:42,635 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2021-08-29 10:21:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:42,635 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2021-08-29 10:21:42,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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) [2021-08-29 10:21:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2021-08-29 10:21:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-29 10:21:42,636 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:42,639 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:42,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:42,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-29 10:21:42,853 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:42,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2021-08-29 10:21:42,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:42,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650458795] [2021-08-29 10:21:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:42,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 10:21:42,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:42,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650458795] [2021-08-29 10:21:42,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650458795] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:42,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363022444] [2021-08-29 10:21:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:42,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:42,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:42,938 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) [2021-08-29 10:21:42,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-29 10:21:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:43,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 10:21:43,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 10:21:43,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 10:21:43,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363022444] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:21:43,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:21:43,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-08-29 10:21:43,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558665407] [2021-08-29 10:21:43,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-29 10:21:43,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-29 10:21:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-29 10:21:43,161 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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) [2021-08-29 10:21:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:43,444 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2021-08-29 10:21:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-29 10:21:43,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 22 [2021-08-29 10:21:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:43,446 INFO L225 Difference]: With dead ends: 181 [2021-08-29 10:21:43,446 INFO L226 Difference]: Without dead ends: 159 [2021-08-29 10:21:43,446 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 78.81ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-08-29 10:21:43,447 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 181.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.19ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 230.83ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:43,447 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 437 Unknown, 0 Unchecked, 2.19ms Time], IncrementalHoareTripleChecker [41 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 230.83ms Time] [2021-08-29 10:21:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-29 10:21:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2021-08-29 10:21:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 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) [2021-08-29 10:21:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2021-08-29 10:21:43,470 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2021-08-29 10:21:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:43,471 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2021-08-29 10:21:43,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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) [2021-08-29 10:21:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2021-08-29 10:21:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-29 10:21:43,475 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:43,476 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:43,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:43,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:43,689 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2021-08-29 10:21:43,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:43,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645464520] [2021-08-29 10:21:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:43,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:43,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:43,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645464520] [2021-08-29 10:21:43,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645464520] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:43,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091126639] [2021-08-29 10:21:43,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:43,749 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:43,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:43,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:21:43,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-29 10:21:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:43,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 10:21:43,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:43,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:43,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091126639] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:21:43,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:21:43,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-08-29 10:21:43,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46929931] [2021-08-29 10:21:43,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-29 10:21:43,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:43,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-29 10:21:43,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-29 10:21:43,969 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) [2021-08-29 10:21:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:44,144 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2021-08-29 10:21:44,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-29 10:21:44,144 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 23 [2021-08-29 10:21:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:44,145 INFO L225 Difference]: With dead ends: 206 [2021-08-29 10:21:44,145 INFO L226 Difference]: Without dead ends: 146 [2021-08-29 10:21:44,146 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 53.13ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-08-29 10:21:44,146 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 117.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.06ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 144.24ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:44,147 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 266 Unknown, 0 Unchecked, 1.06ms Time], IncrementalHoareTripleChecker [38 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 144.24ms Time] [2021-08-29 10:21:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-08-29 10:21:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2021-08-29 10:21:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 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) [2021-08-29 10:21:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2021-08-29 10:21:44,155 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2021-08-29 10:21:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:44,155 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2021-08-29 10:21:44,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) [2021-08-29 10:21:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2021-08-29 10:21:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 10:21:44,156 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:44,156 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:44,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:44,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:44,377 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:44,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2021-08-29 10:21:44,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:44,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352275478] [2021-08-29 10:21:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:44,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:44,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:44,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352275478] [2021-08-29 10:21:44,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352275478] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:44,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478843882] [2021-08-29 10:21:44,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:44,806 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:44,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:44,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:21:44,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-29 10:21:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:44,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-29 10:21:44,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:44,910 INFO L388 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 18 treesize of output 16 [2021-08-29 10:21:44,973 INFO L388 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 0 case distinctions, treesize of input 19 treesize of output 18 [2021-08-29 10:21:45,140 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-08-29 10:21:45,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 37 treesize of output 35 [2021-08-29 10:21:45,598 INFO L354 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-08-29 10:21:45,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 58 treesize of output 40 [2021-08-29 10:21:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:45,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:46,120 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_11 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) is different from false [2021-08-29 10:21:46,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_11 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)))) is different from false [2021-08-29 10:21:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-08-29 10:21:46,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478843882] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:21:46,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:21:46,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2021-08-29 10:21:46,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598122335] [2021-08-29 10:21:46,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-29 10:21:46,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-29 10:21:46,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=370, Unknown=2, NotChecked=82, Total=552 [2021-08-29 10:21:46,587 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 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) [2021-08-29 10:21:46,906 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) 1) (forall ((v_ULTIMATE.start_main_~x~0_11 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_11 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)))) (= c_ULTIMATE.start_main_~i~0 0) (<= 0 |c_ULTIMATE.start_main_~#Dest~0.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| 0)) is different from false [2021-08-29 10:21:47,209 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) 0) 1) (forall ((v_ULTIMATE.start_main_~x~0_11 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_11 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) 0) 0) (<= 0 |c_ULTIMATE.start_main_~#Dest~0.offset|) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| 0)) is different from false [2021-08-29 10:21:47,505 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (forall ((v_ULTIMATE.start_main_~x~0_11 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_11 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) 0) 0) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0) (= c_ULTIMATE.start_main_~j~0 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 1)) is different from false [2021-08-29 10:21:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:47,584 INFO L93 Difference]: Finished difference Result 110 states and 139 transitions. [2021-08-29 10:21:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 10:21:47,584 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 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 25 [2021-08-29 10:21:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:47,585 INFO L225 Difference]: With dead ends: 110 [2021-08-29 10:21:47,585 INFO L226 Difference]: Without dead ends: 98 [2021-08-29 10:21:47,586 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1966.04ms TimeCoverageRelationStatistics Valid=118, Invalid=449, Unknown=5, NotChecked=240, Total=812 [2021-08-29 10:21:47,587 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.43ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 42.35ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:47,587 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 154 Unknown, 0 Unchecked, 0.43ms Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 61 Unchecked, 42.35ms Time] [2021-08-29 10:21:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-29 10:21:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2021-08-29 10:21:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 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) [2021-08-29 10:21:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2021-08-29 10:21:47,595 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 25 [2021-08-29 10:21:47,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:47,595 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2021-08-29 10:21:47,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 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) [2021-08-29 10:21:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2021-08-29 10:21:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 10:21:47,596 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:47,596 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:47,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:47,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:47,813 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2021-08-29 10:21:47,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:47,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169064633] [2021-08-29 10:21:47,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:47,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:21:47,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:47,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169064633] [2021-08-29 10:21:47,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169064633] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:47,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062853143] [2021-08-29 10:21:47,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 10:21:47,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:47,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:21:47,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-29 10:21:48,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 10:21:48,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:21:48,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-29 10:21:48,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:48,036 INFO L388 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 15 treesize of output 11 [2021-08-29 10:21:48,092 INFO L354 Elim1Store]: treesize reduction 46, result has 23.3 percent of original size [2021-08-29 10:21:48,092 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2021-08-29 10:21:48,191 INFO L388 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 33 treesize of output 25 [2021-08-29 10:21:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:21:48,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:50,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~i~0_66 Int)) (or (< v_ULTIMATE.start_main_~i~0_66 (+ c_ULTIMATE.start_main_~i~0 1)) (forall ((~INFINITY~0 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~i~0_66 4) |c_ULTIMATE.start_main_~#distance~0.offset|) ~INFINITY~0) |c_ULTIMATE.start_main_~#distance~0.offset|))))) is different from false [2021-08-29 10:21:50,337 INFO L388 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 27 treesize of output 25 [2021-08-29 10:21:50,340 INFO L388 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 69 treesize of output 67 [2021-08-29 10:21:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2021-08-29 10:21:50,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062853143] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:21:50,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:21:50,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2021-08-29 10:21:50,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101602077] [2021-08-29 10:21:50,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-29 10:21:50,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:50,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-29 10:21:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2021-08-29 10:21:50,387 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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) [2021-08-29 10:21:52,417 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (forall ((v_ULTIMATE.start_main_~i~0_66 Int)) (or (< v_ULTIMATE.start_main_~i~0_66 (+ c_ULTIMATE.start_main_~i~0 1)) (forall ((~INFINITY~0 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~i~0_66 4) |c_ULTIMATE.start_main_~#distance~0.offset|) ~INFINITY~0) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (= (+ (* 4 c_ULTIMATE.start_main_~i~0) |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0)) is different from false [2021-08-29 10:21:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:52,635 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2021-08-29 10:21:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 10:21:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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 25 [2021-08-29 10:21:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:52,637 INFO L225 Difference]: With dead ends: 145 [2021-08-29 10:21:52,638 INFO L226 Difference]: Without dead ends: 143 [2021-08-29 10:21:52,638 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4159.84ms TimeCoverageRelationStatistics Valid=87, Invalid=261, Unknown=2, NotChecked=70, Total=420 [2021-08-29 10:21:52,638 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 152.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.57ms SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 186.43ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:52,639 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 430 Unknown, 0 Unchecked, 1.57ms Time], IncrementalHoareTripleChecker [62 Valid, 297 Invalid, 0 Unknown, 71 Unchecked, 186.43ms Time] [2021-08-29 10:21:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-29 10:21:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2021-08-29 10:21:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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) [2021-08-29 10:21:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2021-08-29 10:21:52,647 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 25 [2021-08-29 10:21:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:52,648 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2021-08-29 10:21:52,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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) [2021-08-29 10:21:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2021-08-29 10:21:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-29 10:21:52,649 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:52,649 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:52,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:52,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:52,869 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2021-08-29 10:21:52,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:52,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030564711] [2021-08-29 10:21:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:52,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:52,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:52,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030564711] [2021-08-29 10:21:52,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030564711] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:52,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388972240] [2021-08-29 10:21:52,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 10:21:52,914 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:52,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:52,915 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:21:52,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-29 10:21:53,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 10:21:53,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:21:53,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 10:21:53,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:53,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:53,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388972240] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:21:53,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:21:53,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-08-29 10:21:53,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718676723] [2021-08-29 10:21:53,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-29 10:21:53,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-29 10:21:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-29 10:21:53,174 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2021-08-29 10:21:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:53,419 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2021-08-29 10:21:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-29 10:21:53,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 28 [2021-08-29 10:21:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:53,421 INFO L225 Difference]: With dead ends: 183 [2021-08-29 10:21:53,421 INFO L226 Difference]: Without dead ends: 170 [2021-08-29 10:21:53,421 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 85.76ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-08-29 10:21:53,422 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 151.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 189.77ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:53,422 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [22 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 189.77ms Time] [2021-08-29 10:21:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-29 10:21:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2021-08-29 10:21:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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) [2021-08-29 10:21:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2021-08-29 10:21:53,432 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 28 [2021-08-29 10:21:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:53,432 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2021-08-29 10:21:53,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2021-08-29 10:21:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2021-08-29 10:21:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 10:21:53,434 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:53,434 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:53,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:53,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:53,649 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:53,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash 160714710, now seen corresponding path program 2 times [2021-08-29 10:21:53,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:53,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204195085] [2021-08-29 10:21:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:53,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 10:21:53,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:53,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204195085] [2021-08-29 10:21:53,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204195085] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:53,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964905674] [2021-08-29 10:21:53,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 10:21:53,693 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:53,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:21:53,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-29 10:21:53,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 10:21:53,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:21:53,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-29 10:21:53,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 10:21:53,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 10:21:53,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964905674] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 10:21:53,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-29 10:21:53,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-08-29 10:21:53,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117526680] [2021-08-29 10:21:53,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 10:21:53,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 10:21:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 10:21:53,840 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) [2021-08-29 10:21:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:53,913 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2021-08-29 10:21:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 10:21:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) Word has length 29 [2021-08-29 10:21:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:53,914 INFO L225 Difference]: With dead ends: 213 [2021-08-29 10:21:53,914 INFO L226 Difference]: Without dead ends: 130 [2021-08-29 10:21:53,915 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.42ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 10:21:53,916 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.24ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.68ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:53,916 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.24ms Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 53.68ms Time] [2021-08-29 10:21:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-08-29 10:21:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2021-08-29 10:21:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 115 states have internal predecessors, (147), 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) [2021-08-29 10:21:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2021-08-29 10:21:53,926 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 29 [2021-08-29 10:21:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:53,926 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2021-08-29 10:21:53,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) [2021-08-29 10:21:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2021-08-29 10:21:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 10:21:53,927 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:53,927 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:53,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:54,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-29 10:21:54,140 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:54,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2021-08-29 10:21:54,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:54,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977480386] [2021-08-29 10:21:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:54,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:21:54,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:54,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977480386] [2021-08-29 10:21:54,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977480386] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:54,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876791157] [2021-08-29 10:21:54,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:54,257 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:54,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:54,258 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:21:54,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-29 10:21:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:54,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-29 10:21:54,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:54,368 INFO L388 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 17 treesize of output 13 [2021-08-29 10:21:54,473 INFO L388 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 37 treesize of output 25 [2021-08-29 10:21:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:21:54,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:54,581 INFO L388 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 16 treesize of output 14 [2021-08-29 10:21:54,583 INFO L388 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 32 treesize of output 28 [2021-08-29 10:21:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:21:54,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876791157] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:21:54,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:21:54,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2021-08-29 10:21:54,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76605124] [2021-08-29 10:21:54,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-29 10:21:54,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:21:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-29 10:21:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-08-29 10:21:54,657 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 21 states have internal predecessors, (72), 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) [2021-08-29 10:21:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:21:55,242 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2021-08-29 10:21:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-29 10:21:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 21 states have internal predecessors, (72), 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 29 [2021-08-29 10:21:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:21:55,244 INFO L225 Difference]: With dead ends: 185 [2021-08-29 10:21:55,244 INFO L226 Difference]: Without dead ends: 183 [2021-08-29 10:21:55,245 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 309.74ms TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2021-08-29 10:21:55,245 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 277 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 326.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.56ms SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 397.35ms IncrementalHoareTripleChecker+Time [2021-08-29 10:21:55,246 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 0 Invalid, 948 Unknown, 0 Unchecked, 3.56ms Time], IncrementalHoareTripleChecker [103 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 397.35ms Time] [2021-08-29 10:21:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-08-29 10:21:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2021-08-29 10:21:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.26890756302521) internal successors, (151), 119 states have internal predecessors, (151), 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) [2021-08-29 10:21:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2021-08-29 10:21:55,256 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 29 [2021-08-29 10:21:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:21:55,257 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2021-08-29 10:21:55,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 21 states have internal predecessors, (72), 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) [2021-08-29 10:21:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2021-08-29 10:21:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-29 10:21:55,258 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:21:55,258 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:21:55,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-29 10:21:55,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:55,471 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:21:55,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:21:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2021-08-29 10:21:55,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:21:55,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600813307] [2021-08-29 10:21:55,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:21:55,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:21:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:21:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:21:56,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:21:56,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600813307] [2021-08-29 10:21:56,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600813307] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:21:56,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006272134] [2021-08-29 10:21:56,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 10:21:56,277 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:21:56,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:21:56,278 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:21:56,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-29 10:21:56,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-29 10:21:56,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:21:56,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-29 10:21:56,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:21:56,432 INFO L388 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 18 treesize of output 16 [2021-08-29 10:21:56,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:21:56,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:21:56,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:21:56,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-08-29 10:21:56,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:21:56,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:21:56,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:21:56,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:21:56,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 10:21:56,711 INFO L354 Elim1Store]: treesize reduction 203, result has 15.1 percent of original size [2021-08-29 10:21:56,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 62 [2021-08-29 10:21:56,956 INFO L354 Elim1Store]: treesize reduction 224, result has 15.2 percent of original size [2021-08-29 10:21:56,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 74 [2021-08-29 10:21:57,688 INFO L354 Elim1Store]: treesize reduction 121, result has 3.2 percent of original size [2021-08-29 10:21:57,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 54 [2021-08-29 10:21:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:21:57,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:21:58,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_22 Int)) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) is different from false [2021-08-29 10:21:58,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_22 Int)) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) is different from false [2021-08-29 10:21:59,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_22 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (<= 0 (select (store .cse0 (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4)))))) is different from false [2021-08-29 10:22:01,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_23 Int)) (or (forall ((v_ULTIMATE.start_main_~x~0_22 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_23 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store .cse0 (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (< v_ULTIMATE.start_main_~x~0_23 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) is different from false [2021-08-29 10:22:01,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_23 Int) (v_ULTIMATE.start_main_~x~0_22 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_23 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (< v_ULTIMATE.start_main_~x~0_23 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)) (<= 0 (select (store .cse0 (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))) is different from false [2021-08-29 10:22:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 7 not checked. [2021-08-29 10:22:05,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006272134] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:22:05,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:22:05,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 34 [2021-08-29 10:22:05,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393548108] [2021-08-29 10:22:05,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-29 10:22:05,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:22:05,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-29 10:22:05,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=677, Unknown=7, NotChecked=290, Total=1122 [2021-08-29 10:22:05,708 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 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) [2021-08-29 10:22:06,222 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (forall ((v_ULTIMATE.start_main_~x~0_23 Int) (v_ULTIMATE.start_main_~x~0_22 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_23 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (< v_ULTIMATE.start_main_~x~0_23 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)) (<= 0 (select (store .cse1 (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= .cse2 1) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= c_ULTIMATE.start_main_~i~0 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (<= 1 .cse2) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0)))) is different from false [2021-08-29 10:22:06,654 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset|))) (and (<= 3 .cse0) (forall ((v_ULTIMATE.start_main_~x~0_23 Int) (v_ULTIMATE.start_main_~x~0_22 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_23 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (< v_ULTIMATE.start_main_~x~0_23 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)) (<= 0 (select (store .cse1 (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= .cse2 1) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse3 0) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (<= 1 .cse2)))) is different from false [2021-08-29 10:22:08,664 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (forall ((v_ULTIMATE.start_main_~x~0_23 Int)) (or (forall ((v_ULTIMATE.start_main_~x~0_22 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_23 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store .cse1 (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (< v_ULTIMATE.start_main_~x~0_23 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (<= 1 (select .cse3 |c_ULTIMATE.start_main_~#Dest~0.offset|)) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0) (= c_ULTIMATE.start_main_~j~0 0) (= (select .cse3 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 1)))) is different from false [2021-08-29 10:22:09,084 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (let ((.cse0 (select .cse4 .cse5)) (.cse2 (store .cse1 (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (or (and (= 3 .cse0) (= c_ULTIMATE.start_main_~x~0 1) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0)) (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (forall ((v_ULTIMATE.start_main_~x~0_22 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (<= 0 (select (store .cse3 (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4)))))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (<= 1 (select .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset|)) (= c_ULTIMATE.start_main_~j~0 0) (or (= 3 (select .cse2 .cse5)) (= .cse5 (+ (* 4 c_ULTIMATE.start_main_~x~0) |c_ULTIMATE.start_main_~#distance~0.offset|))) (<= (select .cse4 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) c_ULTIMATE.start_main_~x~0)))) is different from false [2021-08-29 10:22:09,444 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse1 (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4)))) (let ((.cse0 (= 3 .cse1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (forall ((v_ULTIMATE.start_main_~x~0_22 Int)) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) (or .cse0 (= (+ .cse1 1) 0)) (or (and .cse0 (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0)) (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (<= 3 .cse1) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (exists ((ULTIMATE.start_main_~x~0 Int)) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) ULTIMATE.start_main_~x~0) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|)) 1) 0))) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (<= 1 (select .cse3 |c_ULTIMATE.start_main_~#Dest~0.offset|)) (= c_ULTIMATE.start_main_~j~0 0))))) is different from false [2021-08-29 10:22:09,801 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse3 (select .cse0 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)))) (let ((.cse2 (= .cse3 3)) (.cse1 (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (or (and .cse1 .cse2) (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (exists ((ULTIMATE.start_main_~x~0 Int)) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) ULTIMATE.start_main_~x~0) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|)) 1) 0))) (or (= (+ .cse3 1) 0) .cse2) .cse1 (forall ((v_ULTIMATE.start_main_~x~0_22 Int)) (or (< v_ULTIMATE.start_main_~x~0_22 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_22 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) (= (* 4 c_ULTIMATE.start_main_~j~0) 4) (= (select .cse4 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse4 0) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (<= 1 (select .cse0 |c_ULTIMATE.start_main_~#Dest~0.offset|)) (= c_ULTIMATE.start_main_~j~0 1))))) is different from false [2021-08-29 10:22:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:22:09,960 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2021-08-29 10:22:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-29 10:22:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 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 31 [2021-08-29 10:22:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:22:09,961 INFO L225 Difference]: With dead ends: 139 [2021-08-29 10:22:09,961 INFO L226 Difference]: Without dead ends: 124 [2021-08-29 10:22:09,962 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 12397.56ms TimeCoverageRelationStatistics Valid=188, Invalid=899, Unknown=13, NotChecked=792, Total=1892 [2021-08-29 10:22:09,962 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.63ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 79.46ms IncrementalHoareTripleChecker+Time [2021-08-29 10:22:09,963 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.63ms Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 162 Unchecked, 79.46ms Time] [2021-08-29 10:22:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-29 10:22:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-08-29 10:22:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 122 states have internal predecessors, (155), 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) [2021-08-29 10:22:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2021-08-29 10:22:09,972 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 31 [2021-08-29 10:22:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:22:09,972 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2021-08-29 10:22:09,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 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) [2021-08-29 10:22:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2021-08-29 10:22:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-29 10:22:09,973 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:22:09,973 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:22:10,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-29 10:22:10,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-29 10:22:10,187 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:22:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:22:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1465846464, now seen corresponding path program 1 times [2021-08-29 10:22:10,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:22:10,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391839684] [2021-08-29 10:22:10,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:10,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:22:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 10:22:10,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:22:10,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391839684] [2021-08-29 10:22:10,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391839684] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:22:10,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195286718] [2021-08-29 10:22:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:10,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:10,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:22:10,541 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:22:10,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-29 10:22:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:10,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-29 10:22:10,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:22:10,635 INFO L388 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 18 treesize of output 16 [2021-08-29 10:22:10,684 INFO L388 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 0 case distinctions, treesize of input 19 treesize of output 18 [2021-08-29 10:22:10,825 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-08-29 10:22:10,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 37 treesize of output 35 [2021-08-29 10:22:11,223 INFO L354 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-08-29 10:22:11,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 58 treesize of output 40 [2021-08-29 10:22:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 10:22:11,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:22:11,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_28 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_28 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_28 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) is different from false [2021-08-29 10:22:12,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_28 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_28 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_28 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)))) is different from false [2021-08-29 10:22:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 4 not checked. [2021-08-29 10:22:12,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195286718] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:22:12,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:22:12,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2021-08-29 10:22:12,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120495662] [2021-08-29 10:22:12,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-29 10:22:12,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:22:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-29 10:22:12,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=370, Unknown=2, NotChecked=82, Total=552 [2021-08-29 10:22:12,601 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 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) [2021-08-29 10:22:12,917 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) 1) (= c_ULTIMATE.start_main_~i~0 0) (forall ((v_ULTIMATE.start_main_~x~0_28 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_28 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_28 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)))) (<= 0 |c_ULTIMATE.start_main_~#Dest~0.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| 0)) is different from false [2021-08-29 10:22:13,209 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) 1) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) 0) 0) (forall ((v_ULTIMATE.start_main_~x~0_28 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_28 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_28 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) is different from false [2021-08-29 10:22:13,500 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) 0) 0) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0) (= c_ULTIMATE.start_main_~j~0 0) (forall ((v_ULTIMATE.start_main_~x~0_28 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_28 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_28 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 1)) is different from false [2021-08-29 10:22:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:22:13,610 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2021-08-29 10:22:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 10:22:13,611 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 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 31 [2021-08-29 10:22:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:22:13,611 INFO L225 Difference]: With dead ends: 142 [2021-08-29 10:22:13,611 INFO L226 Difference]: Without dead ends: 127 [2021-08-29 10:22:13,612 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2335.89ms TimeCoverageRelationStatistics Valid=118, Invalid=449, Unknown=5, NotChecked=240, Total=812 [2021-08-29 10:22:13,613 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.67ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 89.17ms IncrementalHoareTripleChecker+Time [2021-08-29 10:22:13,613 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 335 Unknown, 0 Unchecked, 0.67ms Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 142 Unchecked, 89.17ms Time] [2021-08-29 10:22:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-29 10:22:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2021-08-29 10:22:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 122 states have internal predecessors, (155), 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) [2021-08-29 10:22:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2021-08-29 10:22:13,622 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 31 [2021-08-29 10:22:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:22:13,623 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2021-08-29 10:22:13,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 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) [2021-08-29 10:22:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2021-08-29 10:22:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-29 10:22:13,624 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:22:13,624 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:22:13,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-29 10:22:13,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-29 10:22:13,829 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:22:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:22:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2058421380, now seen corresponding path program 2 times [2021-08-29 10:22:13,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:22:13,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33526383] [2021-08-29 10:22:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:13,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:22:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:22:14,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:22:14,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33526383] [2021-08-29 10:22:14,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33526383] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:22:14,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475055232] [2021-08-29 10:22:14,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 10:22:14,087 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:14,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:22:14,088 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:22:14,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-29 10:22:14,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 10:22:14,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:22:14,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-29 10:22:14,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:22:14,186 INFO L388 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 18 treesize of output 16 [2021-08-29 10:22:14,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:14,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-08-29 10:22:14,484 INFO L354 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2021-08-29 10:22:14,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 49 [2021-08-29 10:22:14,998 INFO L354 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2021-08-29 10:22:14,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 43 [2021-08-29 10:22:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:22:15,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:22:15,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_32 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_32 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) is different from false [2021-08-29 10:22:15,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_32 Int)) (or (< v_ULTIMATE.start_main_~x~0_32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_32 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) is different from false [2021-08-29 10:22:16,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_32 Int)) (or (< v_ULTIMATE.start_main_~x~0_32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_32 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) is different from false [2021-08-29 10:22:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 7 not checked. [2021-08-29 10:22:19,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475055232] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:22:19,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:22:19,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2021-08-29 10:22:19,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117545112] [2021-08-29 10:22:19,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-29 10:22:19,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:22:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-29 10:22:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=416, Unknown=5, NotChecked=132, Total=650 [2021-08-29 10:22:19,350 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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) [2021-08-29 10:22:20,149 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= c_ULTIMATE.start_main_~i~0 0) (<= 0 |c_ULTIMATE.start_main_~#Dest~0.offset|) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0) (forall ((v_ULTIMATE.start_main_~x~0_32 Int)) (or (< v_ULTIMATE.start_main_~x~0_32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_32 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))))) is different from false [2021-08-29 10:22:20,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (forall ((v_ULTIMATE.start_main_~x~0_32 Int)) (or (< v_ULTIMATE.start_main_~x~0_32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_32 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))))) is different from false [2021-08-29 10:22:20,742 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (forall ((v_ULTIMATE.start_main_~x~0_32 Int)) (or (< v_ULTIMATE.start_main_~x~0_32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_32 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (= c_ULTIMATE.start_main_~j~0 0)))) is different from false [2021-08-29 10:22:21,048 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (forall ((v_ULTIMATE.start_main_~x~0_32 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_32 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= (select .cse0 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 3) (= (* 4 c_ULTIMATE.start_main_~j~0) 4) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (= c_ULTIMATE.start_main_~j~0 1))) is different from false [2021-08-29 10:22:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:22:21,103 INFO L93 Difference]: Finished difference Result 144 states and 178 transitions. [2021-08-29 10:22:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 10:22:21,103 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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 31 [2021-08-29 10:22:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:22:21,104 INFO L225 Difference]: With dead ends: 144 [2021-08-29 10:22:21,104 INFO L226 Difference]: Without dead ends: 129 [2021-08-29 10:22:21,105 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 6091.48ms TimeCoverageRelationStatistics Valid=120, Invalid=498, Unknown=10, NotChecked=364, Total=992 [2021-08-29 10:22:21,105 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 60.19ms IncrementalHoareTripleChecker+Time [2021-08-29 10:22:21,106 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 360 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 205 Unchecked, 60.19ms Time] [2021-08-29 10:22:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-08-29 10:22:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2021-08-29 10:22:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 122 states have internal predecessors, (155), 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) [2021-08-29 10:22:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2021-08-29 10:22:21,115 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 31 [2021-08-29 10:22:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:22:21,116 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2021-08-29 10:22:21,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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) [2021-08-29 10:22:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2021-08-29 10:22:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-29 10:22:21,117 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:22:21,117 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:22:21,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-29 10:22:21,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-29 10:22:21,329 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:22:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:22:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2021-08-29 10:22:21,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:22:21,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049752154] [2021-08-29 10:22:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:21,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:22:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 10:22:21,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:22:21,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049752154] [2021-08-29 10:22:21,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049752154] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 10:22:21,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 10:22:21,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 10:22:21,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099496993] [2021-08-29 10:22:21,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 10:22:21,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:22:21,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 10:22:21,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 10:22:21,369 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) [2021-08-29 10:22:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:22:21,428 INFO L93 Difference]: Finished difference Result 199 states and 248 transitions. [2021-08-29 10:22:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 10:22:21,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 31 [2021-08-29 10:22:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:22:21,430 INFO L225 Difference]: With dead ends: 199 [2021-08-29 10:22:21,430 INFO L226 Difference]: Without dead ends: 143 [2021-08-29 10:22:21,433 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.07ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 10:22:21,433 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.29ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.68ms IncrementalHoareTripleChecker+Time [2021-08-29 10:22:21,434 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 96 Unknown, 0 Unchecked, 0.29ms Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 47.68ms Time] [2021-08-29 10:22:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-29 10:22:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2021-08-29 10:22:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 122 states have internal predecessors, (154), 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) [2021-08-29 10:22:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2021-08-29 10:22:21,450 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 31 [2021-08-29 10:22:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:22:21,450 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2021-08-29 10:22:21,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) [2021-08-29 10:22:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2021-08-29 10:22:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-29 10:22:21,452 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:22:21,452 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:22:21,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 10:22:21,452 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:22:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:22:21,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 2 times [2021-08-29 10:22:21,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:22:21,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578501754] [2021-08-29 10:22:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:21,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:22:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:22:21,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:22:21,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578501754] [2021-08-29 10:22:21,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578501754] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:22:21,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436320030] [2021-08-29 10:22:21,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 10:22:21,517 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:21,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:22:21,518 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:22:21,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-29 10:22:21,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 10:22:21,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:22:21,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 10:22:21,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:22:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:22:21,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:22:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:22:21,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436320030] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:22:21,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:22:21,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-08-29 10:22:21,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198242653] [2021-08-29 10:22:21,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-29 10:22:21,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:22:21,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-29 10:22:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-08-29 10:22:21,768 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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) [2021-08-29 10:22:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:22:22,027 INFO L93 Difference]: Finished difference Result 405 states and 507 transitions. [2021-08-29 10:22:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-29 10:22:22,028 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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 33 [2021-08-29 10:22:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:22:22,029 INFO L225 Difference]: With dead ends: 405 [2021-08-29 10:22:22,029 INFO L226 Difference]: Without dead ends: 300 [2021-08-29 10:22:22,030 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 89.12ms TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-08-29 10:22:22,030 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 286 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.55ms SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 189.19ms IncrementalHoareTripleChecker+Time [2021-08-29 10:22:22,031 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 0 Invalid, 418 Unknown, 0 Unchecked, 1.55ms Time], IncrementalHoareTripleChecker [117 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 189.19ms Time] [2021-08-29 10:22:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-08-29 10:22:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 206. [2021-08-29 10:22:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 205 states have internal predecessors, (263), 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) [2021-08-29 10:22:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 263 transitions. [2021-08-29 10:22:22,047 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 263 transitions. Word has length 33 [2021-08-29 10:22:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:22:22,047 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 263 transitions. [2021-08-29 10:22:22,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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) [2021-08-29 10:22:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 263 transitions. [2021-08-29 10:22:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-29 10:22:22,048 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:22:22,048 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:22:22,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-29 10:22:22,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-29 10:22:22,261 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:22:22,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:22:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2021-08-29 10:22:22,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:22:22,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644401692] [2021-08-29 10:22:22,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:22,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:22:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:22:22,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:22:22,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644401692] [2021-08-29 10:22:22,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644401692] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:22:22,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362371480] [2021-08-29 10:22:22,315 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 10:22:22,315 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:22,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:22:22,316 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:22:22,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-29 10:22:22,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 10:22:22,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:22:22,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-29 10:22:22,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:22:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:22:22,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:22:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:22:22,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362371480] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:22:22,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:22:22,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-08-29 10:22:22,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219258393] [2021-08-29 10:22:22,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-29 10:22:22,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:22:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-29 10:22:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-29 10:22:22,545 INFO L87 Difference]: Start difference. First operand 206 states and 263 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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) [2021-08-29 10:22:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:22:22,879 INFO L93 Difference]: Finished difference Result 489 states and 613 transitions. [2021-08-29 10:22:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-29 10:22:22,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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 34 [2021-08-29 10:22:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:22:22,881 INFO L225 Difference]: With dead ends: 489 [2021-08-29 10:22:22,881 INFO L226 Difference]: Without dead ends: 467 [2021-08-29 10:22:22,882 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 134.88ms TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2021-08-29 10:22:22,882 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 177.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.57ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 221.48ms IncrementalHoareTripleChecker+Time [2021-08-29 10:22:22,882 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 528 Unknown, 0 Unchecked, 1.57ms Time], IncrementalHoareTripleChecker [27 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 221.48ms Time] [2021-08-29 10:22:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-08-29 10:22:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 291. [2021-08-29 10:22:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.313793103448276) internal successors, (381), 290 states have internal predecessors, (381), 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) [2021-08-29 10:22:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 381 transitions. [2021-08-29 10:22:22,906 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 381 transitions. Word has length 34 [2021-08-29 10:22:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:22:22,906 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 381 transitions. [2021-08-29 10:22:22,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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) [2021-08-29 10:22:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 381 transitions. [2021-08-29 10:22:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-29 10:22:22,907 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:22:22,907 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:22:22,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-29 10:22:23,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:23,121 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:22:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:22:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2021-08-29 10:22:23,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:22:23,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206708838] [2021-08-29 10:22:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:23,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:22:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-29 10:22:23,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:22:23,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206708838] [2021-08-29 10:22:23,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206708838] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:22:23,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842292298] [2021-08-29 10:22:23,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 10:22:23,649 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:22:23,650 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:22:23,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-29 10:22:23,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 10:22:23,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:22:23,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-29 10:22:23,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:22:23,728 INFO L388 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 18 treesize of output 16 [2021-08-29 10:22:23,751 INFO L388 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 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-29 10:22:23,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:23,801 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-29 10:22:23,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-08-29 10:22:23,899 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-08-29 10:22:23,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 35 [2021-08-29 10:22:24,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:24,041 INFO L354 Elim1Store]: treesize reduction 79, result has 16.0 percent of original size [2021-08-29 10:22:24,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 40 [2021-08-29 10:22:24,183 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-29 10:22:24,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 37 [2021-08-29 10:22:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-29 10:22:24,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:22:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-29 10:22:25,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842292298] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:22:25,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:22:25,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 32 [2021-08-29 10:22:25,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983292744] [2021-08-29 10:22:25,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-29 10:22:25,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:22:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-29 10:22:25,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=825, Unknown=2, NotChecked=0, Total=992 [2021-08-29 10:22:25,424 INFO L87 Difference]: Start difference. First operand 291 states and 381 transitions. Second operand has 32 states, 32 states have (on average 2.65625) internal successors, (85), 32 states have internal predecessors, (85), 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) [2021-08-29 10:22:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:22:27,180 INFO L93 Difference]: Finished difference Result 704 states and 893 transitions. [2021-08-29 10:22:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-29 10:22:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 32 states have internal predecessors, (85), 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 34 [2021-08-29 10:22:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:22:27,183 INFO L225 Difference]: With dead ends: 704 [2021-08-29 10:22:27,183 INFO L226 Difference]: Without dead ends: 702 [2021-08-29 10:22:27,185 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 51 SyntacticMatches, 14 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 2505.25ms TimeCoverageRelationStatistics Valid=1018, Invalid=4236, Unknown=2, NotChecked=0, Total=5256 [2021-08-29 10:22:27,185 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 534 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 423.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.65ms SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 655 IncrementalHoareTripleChecker+Unchecked, 540.87ms IncrementalHoareTripleChecker+Time [2021-08-29 10:22:27,186 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 0 Invalid, 1769 Unknown, 0 Unchecked, 5.65ms Time], IncrementalHoareTripleChecker [237 Valid, 877 Invalid, 0 Unknown, 655 Unchecked, 540.87ms Time] [2021-08-29 10:22:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-08-29 10:22:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 471. [2021-08-29 10:22:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.3446808510638297) internal successors, (632), 470 states have internal predecessors, (632), 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) [2021-08-29 10:22:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 632 transitions. [2021-08-29 10:22:27,227 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 632 transitions. Word has length 34 [2021-08-29 10:22:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:22:27,228 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 632 transitions. [2021-08-29 10:22:27,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.65625) internal successors, (85), 32 states have internal predecessors, (85), 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) [2021-08-29 10:22:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 632 transitions. [2021-08-29 10:22:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 10:22:27,229 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:22:27,229 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:22:27,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-29 10:22:27,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-29 10:22:27,437 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:22:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:22:27,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1136182421, now seen corresponding path program 5 times [2021-08-29 10:22:27,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:22:27,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974831667] [2021-08-29 10:22:27,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:27,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:22:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 10:22:28,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:22:28,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974831667] [2021-08-29 10:22:28,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974831667] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:22:28,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047099206] [2021-08-29 10:22:28,656 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-29 10:22:28,656 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:28,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:22:28,657 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:22:28,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-29 10:22:28,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-08-29 10:22:28,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:22:28,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-29 10:22:28,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:22:28,874 INFO L388 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 25 treesize of output 23 [2021-08-29 10:22:28,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:28,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:28,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,004 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-29 10:22:29,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 66 [2021-08-29 10:22:29,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 10:22:29,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,391 INFO L354 Elim1Store]: treesize reduction 199, result has 19.1 percent of original size [2021-08-29 10:22:29,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 74 treesize of output 90 [2021-08-29 10:22:29,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 10:22:29,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,699 INFO L354 Elim1Store]: treesize reduction 335, result has 13.0 percent of original size [2021-08-29 10:22:29,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 94 treesize of output 105 [2021-08-29 10:22:29,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 10:22:29,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:29,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:30,022 INFO L354 Elim1Store]: treesize reduction 292, result has 17.0 percent of original size [2021-08-29 10:22:30,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 31 case distinctions, treesize of input 105 treesize of output 116 [2021-08-29 10:22:33,266 INFO L354 Elim1Store]: treesize reduction 128, result has 9.2 percent of original size [2021-08-29 10:22:33,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 108 treesize of output 74 [2021-08-29 10:22:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-29 10:22:33,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:22:34,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse1 (* c_ULTIMATE.start_main_~j~0 4))) (or (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 4)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_50 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset|)))))) is different from false [2021-08-29 10:22:34,702 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse1 (* c_ULTIMATE.start_main_~j~0 4))) (or (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_50 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 4)))))) is different from false [2021-08-29 10:22:35,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse1 (* c_ULTIMATE.start_main_~j~0 4)) (.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse2 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|))))) is different from false [2021-08-29 10:22:36,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse1 (* c_ULTIMATE.start_main_~j~0 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset|)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse2 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)))))) is different from false [2021-08-29 10:22:38,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse1 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|))))) is different from false [2021-08-29 10:22:40,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse0 (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* c_ULTIMATE.start_main_~source~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) 0))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))))) (or (< v_ULTIMATE.start_main_~x~0_50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse1 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|))))) is different from false [2021-08-29 10:22:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 11 not checked. [2021-08-29 10:22:40,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047099206] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:22:40,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:22:40,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 15] total 49 [2021-08-29 10:22:40,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22498224] [2021-08-29 10:22:40,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-08-29 10:22:40,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:22:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-08-29 10:22:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1532, Unknown=6, NotChecked=522, Total=2352 [2021-08-29 10:22:40,841 INFO L87 Difference]: Start difference. First operand 471 states and 632 transitions. Second operand has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 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) [2021-08-29 10:22:45,204 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= c_ULTIMATE.start_main_~i~0 0) (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse4 (store .cse3 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse4 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|)))) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0)))) is different from false [2021-08-29 10:22:45,737 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= (select .cse2 0) 0) (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse4 (store .cse3 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse4 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|)))) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|)))) is different from false [2021-08-29 10:22:46,280 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse3 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse1 (* c_ULTIMATE.start_main_~j~0 4))) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset|)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse2 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)))))) (<= 3 .cse3) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (= (select .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse3) (= (select .cse5 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= (select .cse5 0) 0) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|)))) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0) (= c_ULTIMATE.start_main_~j~0 0) (= (select .cse4 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 1)))) is different from false [2021-08-29 10:22:46,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse3 (* c_ULTIMATE.start_main_~j~0 4)) (.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse3 |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse4 (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse4 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse3 |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (= 3 .cse0) (= c_ULTIMATE.start_main_~x~0 (select .cse1 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (= c_ULTIMATE.start_main_~x~0 1) (= (select .cse5 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select (store .cse5 (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) 0) 0) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|)))) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0) (= c_ULTIMATE.start_main_~j~0 0)))) is different from false [2021-08-29 10:22:47,230 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse5 (select .cse1 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse4 (* c_ULTIMATE.start_main_~j~0 4))) (or (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_50 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset| 4)))))) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= (select .cse2 0) 0) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|)))) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (= (+ (select .cse2 (+ (* .cse5 4) |c_ULTIMATE.start_main_~#distance~0.offset|)) 1) 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0) (= c_ULTIMATE.start_main_~j~0 0) (= .cse5 1)))) is different from false [2021-08-29 10:22:47,664 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse3 (* 4 c_ULTIMATE.start_main_~j~0))) (and (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (= .cse1 1) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= (+ (select .cse2 (+ (* .cse1 4) |c_ULTIMATE.start_main_~#distance~0.offset|)) 1) 0) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= (select .cse0 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 3) (= .cse3 4) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= (select .cse2 0) 0) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|) 16) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|)))) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (forall ((v_ULTIMATE.start_main_~x~0_50 Int)) (let ((.cse5 (* c_ULTIMATE.start_main_~j~0 4))) (or (<= 0 (select (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_50 4)) (- 1)))) (store .cse4 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse5 |c_ULTIMATE.start_main_~#Dest~0.offset| 4)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_50 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse5 |c_ULTIMATE.start_main_~#Dest~0.offset|)))))) (<= (+ |c_ULTIMATE.start_main_~#Source~0.offset| 4) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| .cse3)) (= c_ULTIMATE.start_main_~j~0 1)))) is different from false [2021-08-29 10:22:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:22:52,737 INFO L93 Difference]: Finished difference Result 500 states and 664 transitions. [2021-08-29 10:22:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-29 10:22:52,741 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 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 37 [2021-08-29 10:22:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:22:52,743 INFO L225 Difference]: With dead ends: 500 [2021-08-29 10:22:52,743 INFO L226 Difference]: Without dead ends: 482 [2021-08-29 10:22:52,744 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 22466.87ms TimeCoverageRelationStatistics Valid=396, Invalid=2190, Unknown=12, NotChecked=1308, Total=3906 [2021-08-29 10:22:52,745 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.86ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 136.87ms IncrementalHoareTripleChecker+Time [2021-08-29 10:22:52,745 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 576 Unknown, 0 Unchecked, 0.86ms Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 338 Unchecked, 136.87ms Time] [2021-08-29 10:22:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-29 10:22:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 477. [2021-08-29 10:22:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.3445378151260505) internal successors, (640), 476 states have internal predecessors, (640), 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) [2021-08-29 10:22:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 640 transitions. [2021-08-29 10:22:52,781 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 640 transitions. Word has length 37 [2021-08-29 10:22:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:22:52,781 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 640 transitions. [2021-08-29 10:22:52,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 49 states have internal predecessors, (91), 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) [2021-08-29 10:22:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 640 transitions. [2021-08-29 10:22:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 10:22:52,782 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:22:52,782 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:22:52,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-29 10:22:52,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:52,985 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:22:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:22:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash 318533971, now seen corresponding path program 3 times [2021-08-29 10:22:52,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:22:52,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084846143] [2021-08-29 10:22:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:22:52,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:22:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:22:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-29 10:22:53,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:22:53,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084846143] [2021-08-29 10:22:53,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084846143] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:22:53,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793435872] [2021-08-29 10:22:53,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 10:22:53,519 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:22:53,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:22:53,520 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:22:53,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-29 10:22:53,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-29 10:22:53,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:22:53,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-29 10:22:53,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:22:53,651 INFO L388 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 18 treesize of output 16 [2021-08-29 10:22:53,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:53,711 INFO L354 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2021-08-29 10:22:53,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2021-08-29 10:22:53,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:22:53,905 INFO L354 Elim1Store]: treesize reduction 132, result has 15.4 percent of original size [2021-08-29 10:22:53,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 59 [2021-08-29 10:22:54,126 INFO L354 Elim1Store]: treesize reduction 304, result has 13.6 percent of original size [2021-08-29 10:22:54,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 75 treesize of output 91 [2021-08-29 10:23:03,590 INFO L354 Elim1Store]: treesize reduction 232, result has 12.5 percent of original size [2021-08-29 10:23:03,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 92 [2021-08-29 10:23:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 10:23:03,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:23:38,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_58 Int) (ULTIMATE.start_main_~j~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (<= 0 (select (store .cse0 (+ (* v_ULTIMATE.start_main_~x~0_58 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (<= ULTIMATE.start_main_~j~0 0) (<= 2 ULTIMATE.start_main_~j~0) (< v_ULTIMATE.start_main_~x~0_58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)))))) is different from false [2021-08-29 10:23:41,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_59 Int)) (or (< v_ULTIMATE.start_main_~x~0_59 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (forall ((v_ULTIMATE.start_main_~x~0_58 Int) (ULTIMATE.start_main_~j~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_59 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= ULTIMATE.start_main_~j~0 0) (<= 2 ULTIMATE.start_main_~j~0) (<= 0 (select (store .cse0 (+ (* v_ULTIMATE.start_main_~x~0_58 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))))) is different from false [2021-08-29 10:23:41,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_59 Int) (v_ULTIMATE.start_main_~x~0_58 Int) (ULTIMATE.start_main_~j~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_59 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= ULTIMATE.start_main_~j~0 0) (<= 2 ULTIMATE.start_main_~j~0) (< v_ULTIMATE.start_main_~x~0_59 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)) (<= 0 (select (store .cse0 (+ (* v_ULTIMATE.start_main_~x~0_58 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))) is different from false [2021-08-29 10:23:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-08-29 10:23:43,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793435872] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:23:43,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:23:43,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 21] total 52 [2021-08-29 10:23:43,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044253441] [2021-08-29 10:23:43,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-08-29 10:23:43,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:23:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-08-29 10:23:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1905, Unknown=17, NotChecked=288, Total=2652 [2021-08-29 10:23:43,511 INFO L87 Difference]: Start difference. First operand 477 states and 640 transitions. Second operand has 52 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 52 states have internal predecessors, (99), 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) [2021-08-29 10:23:46,180 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= .cse1 1) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (forall ((v_ULTIMATE.start_main_~x~0_59 Int) (v_ULTIMATE.start_main_~x~0_58 Int) (ULTIMATE.start_main_~j~0 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_59 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= ULTIMATE.start_main_~j~0 0) (<= 2 ULTIMATE.start_main_~j~0) (< v_ULTIMATE.start_main_~x~0_59 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)) (<= 0 (select (store .cse2 (+ (* v_ULTIMATE.start_main_~x~0_58 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= c_ULTIMATE.start_main_~i~0 0) (<= 0 |c_ULTIMATE.start_main_~#Dest~0.offset|) (<= 1 .cse1) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) (+ |c_ULTIMATE.start_main_~#Source~0.offset| 8)) 1) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| 0)))) is different from false [2021-08-29 10:23:46,793 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= .cse1 1) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (forall ((v_ULTIMATE.start_main_~x~0_59 Int) (v_ULTIMATE.start_main_~x~0_58 Int) (ULTIMATE.start_main_~j~0 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_59 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= ULTIMATE.start_main_~j~0 0) (<= 2 ULTIMATE.start_main_~j~0) (< v_ULTIMATE.start_main_~x~0_59 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) |c_ULTIMATE.start_main_~#Dest~0.offset|)) (<= 0 (select (store .cse2 (+ (* v_ULTIMATE.start_main_~x~0_58 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse3 0) 0) (<= 1 .cse1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) (+ |c_ULTIMATE.start_main_~#Source~0.offset| 8)) 1)))) is different from false [2021-08-29 10:23:48,799 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (<= 1 (select .cse2 |c_ULTIMATE.start_main_~#Dest~0.offset|)) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0) (= c_ULTIMATE.start_main_~j~0 0) (forall ((v_ULTIMATE.start_main_~x~0_59 Int)) (or (< v_ULTIMATE.start_main_~x~0_59 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (forall ((v_ULTIMATE.start_main_~x~0_58 Int) (ULTIMATE.start_main_~j~0 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_59 4)) (- 1)))) (or (< v_ULTIMATE.start_main_~x~0_58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= ULTIMATE.start_main_~j~0 0) (<= 2 ULTIMATE.start_main_~j~0) (<= 0 (select (store .cse3 (+ (* v_ULTIMATE.start_main_~x~0_58 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) (+ |c_ULTIMATE.start_main_~#Source~0.offset| 8)) 1) (= (select .cse2 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 1)))) is different from false [2021-08-29 10:23:49,311 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse1 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~#Dest~0.offset|))) (and (forall ((v_ULTIMATE.start_main_~x~0_58 Int) (ULTIMATE.start_main_~j~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)))) (or (<= 0 (select (store .cse0 (+ (* v_ULTIMATE.start_main_~x~0_58 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (<= ULTIMATE.start_main_~j~0 0) (<= 2 ULTIMATE.start_main_~j~0) (< v_ULTIMATE.start_main_~x~0_58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)))))) (<= 3 .cse1) (<= .cse2 c_ULTIMATE.start_main_~x~0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse1) (= c_ULTIMATE.start_main_~x~0 1) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select (store .cse3 (+ (* c_ULTIMATE.start_main_~x~0 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) 0) 0) (<= 1 .cse2) (= (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)) 0) (= c_ULTIMATE.start_main_~j~0 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) (+ |c_ULTIMATE.start_main_~#Source~0.offset| 8)) 1)))) is different from false [2021-08-29 10:24:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:24:38,157 INFO L93 Difference]: Finished difference Result 523 states and 691 transitions. [2021-08-29 10:24:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-29 10:24:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 52 states have internal predecessors, (99), 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 37 [2021-08-29 10:24:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:24:38,159 INFO L225 Difference]: With dead ends: 523 [2021-08-29 10:24:38,159 INFO L226 Difference]: Without dead ends: 490 [2021-08-29 10:24:38,161 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 100907.95ms TimeCoverageRelationStatistics Valid=708, Invalid=3180, Unknown=46, NotChecked=896, Total=4830 [2021-08-29 10:24:38,161 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.20ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 20.90ms IncrementalHoareTripleChecker+Time [2021-08-29 10:24:38,161 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 0.20ms Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 164 Unchecked, 20.90ms Time] [2021-08-29 10:24:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-08-29 10:24:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2021-08-29 10:24:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.3446088794926003) internal successors, (636), 473 states have internal predecessors, (636), 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) [2021-08-29 10:24:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 636 transitions. [2021-08-29 10:24:38,212 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 636 transitions. Word has length 37 [2021-08-29 10:24:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:24:38,213 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 636 transitions. [2021-08-29 10:24:38,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 52 states have internal predecessors, (99), 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) [2021-08-29 10:24:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 636 transitions. [2021-08-29 10:24:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 10:24:38,214 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:24:38,214 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:24:38,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-29 10:24:38,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:24:38,417 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:24:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:24:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash -669255913, now seen corresponding path program 4 times [2021-08-29 10:24:38,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:24:38,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502360114] [2021-08-29 10:24:38,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:24:38,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:24:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:24:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:24:39,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:24:39,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502360114] [2021-08-29 10:24:39,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502360114] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:24:39,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965872978] [2021-08-29 10:24:39,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 10:24:39,112 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:24:39,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:24:39,112 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:24:39,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-29 10:24:39,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 10:24:39,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:24:39,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-29 10:24:39,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:24:39,245 INFO L388 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 18 treesize of output 16 [2021-08-29 10:24:39,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:24:39,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2021-08-29 10:24:39,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:24:39,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:24:39,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 10:24:39,588 INFO L354 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-08-29 10:24:39,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 69 [2021-08-29 10:24:40,347 INFO L354 Elim1Store]: treesize reduction 196, result has 22.5 percent of original size [2021-08-29 10:24:40,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 106 [2021-08-29 10:24:42,312 INFO L354 Elim1Store]: treesize reduction 151, result has 5.0 percent of original size [2021-08-29 10:24:42,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 60 [2021-08-29 10:24:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-29 10:24:42,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:25:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-29 10:25:11,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965872978] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:25:11,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:25:11,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2021-08-29 10:25:11,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607201542] [2021-08-29 10:25:11,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-08-29 10:25:11,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:25:11,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-08-29 10:25:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1684, Unknown=23, NotChecked=0, Total=1980 [2021-08-29 10:25:11,076 INFO L87 Difference]: Start difference. First operand 474 states and 636 transitions. Second operand has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 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) [2021-08-29 10:25:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:25:12,144 INFO L93 Difference]: Finished difference Result 500 states and 664 transitions. [2021-08-29 10:25:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-29 10:25:12,145 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 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 37 [2021-08-29 10:25:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:25:12,146 INFO L225 Difference]: With dead ends: 500 [2021-08-29 10:25:12,146 INFO L226 Difference]: Without dead ends: 482 [2021-08-29 10:25:12,147 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 30292.41ms TimeCoverageRelationStatistics Valid=515, Invalid=3244, Unknown=23, NotChecked=0, Total=3782 [2021-08-29 10:25:12,147 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.46ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 57.76ms IncrementalHoareTripleChecker+Time [2021-08-29 10:25:12,148 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 339 Unknown, 0 Unchecked, 0.46ms Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 201 Unchecked, 57.76ms Time] [2021-08-29 10:25:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-29 10:25:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 474. [2021-08-29 10:25:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.3446088794926003) internal successors, (636), 473 states have internal predecessors, (636), 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) [2021-08-29 10:25:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 636 transitions. [2021-08-29 10:25:12,181 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 636 transitions. Word has length 37 [2021-08-29 10:25:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:25:12,181 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 636 transitions. [2021-08-29 10:25:12,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 45 states have internal predecessors, (87), 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) [2021-08-29 10:25:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 636 transitions. [2021-08-29 10:25:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 10:25:12,183 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:25:12,183 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:25:12,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-29 10:25:12,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:25:12,401 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:25:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:25:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1198222035, now seen corresponding path program 5 times [2021-08-29 10:25:12,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:25:12,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463871319] [2021-08-29 10:25:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:25:12,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:25:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:25:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-29 10:25:13,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:25:13,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463871319] [2021-08-29 10:25:13,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463871319] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:25:13,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164026789] [2021-08-29 10:25:13,042 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-29 10:25:13,042 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:25:13,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:25:13,043 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:25:13,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-29 10:25:13,202 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-08-29 10:25:13,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:25:13,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 46 conjunts are in the unsatisfiable core [2021-08-29 10:25:13,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:25:13,226 INFO L388 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 32 treesize of output 30 [2021-08-29 10:25:13,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 10:25:13,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,335 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-29 10:25:13,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 64 treesize of output 78 [2021-08-29 10:25:13,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 10:25:13,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 10:25:13,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:13,840 INFO L354 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2021-08-29 10:25:13,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 86 treesize of output 97 [2021-08-29 10:25:14,157 INFO L354 Elim1Store]: treesize reduction 280, result has 16.2 percent of original size [2021-08-29 10:25:14,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 97 treesize of output 112 [2021-08-29 10:25:15,202 INFO L354 Elim1Store]: treesize reduction 171, result has 2.3 percent of original size [2021-08-29 10:25:15,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 70 [2021-08-29 10:25:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-29 10:25:15,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:25:16,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_74 Int)) (let ((.cse1 (* c_ULTIMATE.start_main_~j~0 4))) (or (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_74 4)) (- 1)))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 4)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_74 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset|)))))) is different from false [2021-08-29 10:25:16,902 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_74 Int)) (let ((.cse0 (* c_ULTIMATE.start_main_~j~0 4))) (or (< v_ULTIMATE.start_main_~x~0_74 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse0 |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_74 4)) (- 1)))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse0 |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|))))) is different from false [2021-08-29 10:25:17,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_74 Int)) (or (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_74 4)) (- 1)))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_74 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))))) is different from false [2021-08-29 10:25:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 11 not checked. [2021-08-29 10:25:18,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164026789] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:25:18,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:25:18,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 13] total 39 [2021-08-29 10:25:18,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026167099] [2021-08-29 10:25:18,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-08-29 10:25:18,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:25:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-08-29 10:25:18,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1063, Unknown=3, NotChecked=210, Total=1482 [2021-08-29 10:25:18,633 INFO L87 Difference]: Start difference. First operand 474 states and 636 transitions. Second operand has 39 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 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) [2021-08-29 10:25:19,201 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|))) (and (= (select .cse1 4) 1) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|))))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (forall ((v_ULTIMATE.start_main_~x~0_74 Int)) (or (<= 0 (select (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_74 4)) (- 1)))) (store .cse4 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_74 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))))) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= c_ULTIMATE.start_main_~i~0 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (<= 0 |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (= (select .cse3 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0)))) is different from false [2021-08-29 10:25:19,686 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|))) (and (= (select .cse1 4) 1) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|))))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (forall ((v_ULTIMATE.start_main_~x~0_74 Int)) (or (<= 0 (select (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_74 4)) (- 1)))) (store .cse4 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_74 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))))) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= (select .cse3 0) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|)))) is different from false [2021-08-29 10:25:20,171 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|))) (let ((.cse0 (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (forall ((v_ULTIMATE.start_main_~x~0_74 Int)) (let ((.cse1 (* c_ULTIMATE.start_main_~j~0 4))) (or (< v_ULTIMATE.start_main_~x~0_74 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_74 4)) (- 1)))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse1 |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|))))) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|))) (and (= (select .cse3 4) 1) (= (select .cse3 0) 0) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|))))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse5 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= (select .cse5 0) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (= c_ULTIMATE.start_main_~j~0 0)))) is different from false [2021-08-29 10:25:20,646 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#Source~0.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)))) (and (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (exists ((|ULTIMATE.start_main_~#Weight~0.base| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~#Weight~0.base|))) (and (= (select .cse1 4) 1) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Weight~0.base|))))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8)) 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Source~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= (select .cse0 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 3) (<= .cse2 .cse3) (= (select .cse4 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (forall ((v_ULTIMATE.start_main_~x~0_74 Int)) (let ((.cse6 (* c_ULTIMATE.start_main_~j~0 4))) (or (<= 0 (select (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* v_ULTIMATE.start_main_~x~0_74 4)) (- 1)))) (store .cse5 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base| .cse5) |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse6 |c_ULTIMATE.start_main_~#Dest~0.offset| 4)) 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1))) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_74 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ .cse6 |c_ULTIMATE.start_main_~#Dest~0.offset|)))))) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0.base|) |c_ULTIMATE.start_main_~#Source~0.offset|)) (= (select .cse4 0) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 28)) 4) (= |c_ULTIMATE.start_main_~#Source~0.offset| 0) (= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (<= .cse3 .cse2) (= c_ULTIMATE.start_main_~j~0 1))) is different from false [2021-08-29 10:25:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:25:20,994 INFO L93 Difference]: Finished difference Result 503 states and 668 transitions. [2021-08-29 10:25:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-29 10:25:20,994 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 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 37 [2021-08-29 10:25:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:25:20,996 INFO L225 Difference]: With dead ends: 503 [2021-08-29 10:25:20,996 INFO L226 Difference]: Without dead ends: 485 [2021-08-29 10:25:20,997 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 6182.56ms TimeCoverageRelationStatistics Valid=265, Invalid=1478, Unknown=7, NotChecked=602, Total=2352 [2021-08-29 10:25:20,997 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.38ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 71.84ms IncrementalHoareTripleChecker+Time [2021-08-29 10:25:20,997 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 317 Unknown, 0 Unchecked, 0.38ms Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 166 Unchecked, 71.84ms Time] [2021-08-29 10:25:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-08-29 10:25:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 480. [2021-08-29 10:25:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.3444676409185803) internal successors, (644), 479 states have internal predecessors, (644), 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) [2021-08-29 10:25:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 644 transitions. [2021-08-29 10:25:21,029 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 644 transitions. Word has length 37 [2021-08-29 10:25:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:25:21,029 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 644 transitions. [2021-08-29 10:25:21,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 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) [2021-08-29 10:25:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 644 transitions. [2021-08-29 10:25:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 10:25:21,031 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:25:21,031 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:25:21,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-08-29 10:25:21,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:25:21,255 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:25:21,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:25:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash 380573585, now seen corresponding path program 6 times [2021-08-29 10:25:21,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:25:21,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931460515] [2021-08-29 10:25:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:25:21,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:25:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:25:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-29 10:25:21,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:25:21,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931460515] [2021-08-29 10:25:21,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931460515] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:25:21,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255402206] [2021-08-29 10:25:21,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-29 10:25:21,506 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:25:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:25:21,506 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:25:21,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-29 10:25:21,584 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-08-29 10:25:21,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 10:25:21,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-29 10:25:21,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:25:21,603 INFO L388 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 27 treesize of output 25 [2021-08-29 10:25:21,671 INFO L354 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2021-08-29 10:25:21,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2021-08-29 10:25:21,983 INFO L354 Elim1Store]: treesize reduction 122, result has 16.4 percent of original size [2021-08-29 10:25:21,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 55 [2021-08-29 10:25:22,589 INFO L354 Elim1Store]: treesize reduction 55, result has 20.3 percent of original size [2021-08-29 10:25:22,589 INFO L388 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 61 [2021-08-29 10:25:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-29 10:25:22,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:25:23,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_81 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_81 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_81 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) is different from false [2021-08-29 10:25:23,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_81 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_81 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_81 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))))) is different from false [2021-08-29 10:25:24,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_81 Int)) (or (< v_ULTIMATE.start_main_~x~0_81 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_81 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) is different from false [2021-08-29 10:25:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 11 not checked. [2021-08-29 10:25:25,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255402206] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:25:25,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:25:25,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2021-08-29 10:25:25,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73940159] [2021-08-29 10:25:25,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-29 10:25:25,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:25:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-29 10:25:25,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=417, Unknown=4, NotChecked=132, Total=650 [2021-08-29 10:25:25,818 INFO L87 Difference]: Start difference. First operand 480 states and 644 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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) [2021-08-29 10:25:26,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (exists ((|ULTIMATE.start_main_~#Source~0.base| Int) (|ULTIMATE.start_main_~#Source~0.offset| Int)) (and (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Source~0.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Source~0.base|) (+ |ULTIMATE.start_main_~#Source~0.offset| 32)) 4))) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= c_ULTIMATE.start_main_~i~0 0) (<= 0 |c_ULTIMATE.start_main_~#Dest~0.offset|) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0) (forall ((v_ULTIMATE.start_main_~x~0_81 Int)) (or (< v_ULTIMATE.start_main_~x~0_81 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_81 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))))) is different from false [2021-08-29 10:25:26,615 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (exists ((|ULTIMATE.start_main_~#Source~0.base| Int) (|ULTIMATE.start_main_~#Source~0.offset| Int)) (and (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Source~0.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Source~0.base|) (+ |ULTIMATE.start_main_~#Source~0.offset| 32)) 4))) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (forall ((v_ULTIMATE.start_main_~x~0_81 Int)) (or (< v_ULTIMATE.start_main_~x~0_81 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_81 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))))) is different from false [2021-08-29 10:25:26,999 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 .cse0) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (exists ((|ULTIMATE.start_main_~#Source~0.base| Int) (|ULTIMATE.start_main_~#Source~0.offset| Int)) (and (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Source~0.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Source~0.base|) (+ |ULTIMATE.start_main_~#Source~0.offset| 32)) 4))) (forall ((v_ULTIMATE.start_main_~x~0_81 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_81 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_81 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))))) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= 3 .cse0) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (= c_ULTIMATE.start_main_~j~0 0))) is different from false [2021-08-29 10:25:27,393 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 4))) (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (exists ((|ULTIMATE.start_main_~#Source~0.base| Int) (|ULTIMATE.start_main_~#Source~0.offset| Int)) (and (not (= |c_ULTIMATE.start_main_~#distance~0.base| |ULTIMATE.start_main_~#Source~0.base|)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#Source~0.base|) (+ |ULTIMATE.start_main_~#Source~0.offset| 32)) 4))) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= (select .cse0 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 3) (= (* 4 c_ULTIMATE.start_main_~j~0) 4) (forall ((v_ULTIMATE.start_main_~x~0_81 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_81 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_81 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))))) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (= c_ULTIMATE.start_main_~j~0 1))) is different from false [2021-08-29 10:25:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:25:27,452 INFO L93 Difference]: Finished difference Result 507 states and 674 transitions. [2021-08-29 10:25:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 10:25:27,452 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 37 [2021-08-29 10:25:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:25:27,454 INFO L225 Difference]: With dead ends: 507 [2021-08-29 10:25:27,454 INFO L226 Difference]: Without dead ends: 489 [2021-08-29 10:25:27,454 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 4865.73ms TimeCoverageRelationStatistics Valid=110, Invalid=462, Unknown=8, NotChecked=350, Total=930 [2021-08-29 10:25:27,454 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.26ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 47.37ms IncrementalHoareTripleChecker+Time [2021-08-29 10:25:27,455 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 226 Unknown, 0 Unchecked, 0.26ms Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 123 Unchecked, 47.37ms Time] [2021-08-29 10:25:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-08-29 10:25:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 477. [2021-08-29 10:25:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.3445378151260505) internal successors, (640), 476 states have internal predecessors, (640), 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) [2021-08-29 10:25:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 640 transitions. [2021-08-29 10:25:27,489 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 640 transitions. Word has length 37 [2021-08-29 10:25:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:25:27,490 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 640 transitions. [2021-08-29 10:25:27,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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) [2021-08-29 10:25:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 640 transitions. [2021-08-29 10:25:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 10:25:27,491 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:25:27,491 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:25:27,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-29 10:25:27,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-29 10:25:27,701 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:25:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:25:27,701 INFO L82 PathProgramCache]: Analyzing trace with hash -607216299, now seen corresponding path program 7 times [2021-08-29 10:25:27,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:25:27,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302895418] [2021-08-29 10:25:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:25:27,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:25:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:25:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-29 10:25:28,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:25:28,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302895418] [2021-08-29 10:25:28,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302895418] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:25:28,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209415334] [2021-08-29 10:25:28,108 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-29 10:25:28,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:25:28,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:25:28,109 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:25:28,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-29 10:25:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:25:28,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-29 10:25:28,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:25:28,237 INFO L388 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 18 treesize of output 16 [2021-08-29 10:25:28,272 INFO L388 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 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-29 10:25:28,508 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-08-29 10:25:28,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 39 [2021-08-29 10:25:28,951 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-08-29 10:25:28,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 40 [2021-08-29 10:25:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-29 10:25:28,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:25:29,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) is different from false [2021-08-29 10:25:29,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))))) is different from false [2021-08-29 10:25:30,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 8))))) is different from false [2021-08-29 10:25:30,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8))))) is different from false [2021-08-29 10:25:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2021-08-29 10:25:32,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209415334] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:25:32,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:25:32,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2021-08-29 10:25:32,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760991239] [2021-08-29 10:25:32,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-29 10:25:32,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:25:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-29 10:25:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=501, Unknown=6, NotChecked=196, Total=812 [2021-08-29 10:25:32,802 INFO L87 Difference]: Start difference. First operand 477 states and 640 transitions. Second operand has 29 states, 29 states have (on average 2.896551724137931) internal successors, (84), 29 states have internal predecessors, (84), 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) [2021-08-29 10:25:33,234 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8))))) (= .cse0 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (<= 4 .cse0) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= c_ULTIMATE.start_main_~i~0 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#distance~0.offset| (* c_ULTIMATE.start_main_~i~0 4))) 0))) is different from false [2021-08-29 10:25:33,603 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8))))) (= .cse0 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (<= 4 .cse0) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|))) is different from false [2021-08-29 10:25:33,977 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= .cse0 4) (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 8))))) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (<= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (<= 4 .cse0) (= (select .cse1 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (<= |c_ULTIMATE.start_main_~#Dest~0.offset| |c_ULTIMATE.start_main_~#Source~0.offset|) (= c_ULTIMATE.start_main_~j~0 0))) is different from false [2021-08-29 10:25:34,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#Source~0.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)))) (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (= .cse0 4) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (<= 4 .cse0) (<= .cse1 .cse2) (= (select .cse3 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse3 0) 0) (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)) (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset| 4))))) (= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (<= .cse2 .cse1) (= c_ULTIMATE.start_main_~j~0 1))) is different from false [2021-08-29 10:25:34,720 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| (* 4 c_ULTIMATE.start_main_~j~0)))) (and (= |c_ULTIMATE.start_main_~#distance~0.offset| 0) (forall ((v_ULTIMATE.start_main_~x~0_87 Int)) (or (< v_ULTIMATE.start_main_~x~0_87 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0.base|) (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|))) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0.base|) (+ (* v_ULTIMATE.start_main_~x~0_87 4) |c_ULTIMATE.start_main_~#distance~0.offset|) (- 1)) |c_ULTIMATE.start_main_~#distance~0.offset|)))) (not (= |c_ULTIMATE.start_main_~#distance~0.base| |c_ULTIMATE.start_main_~#Dest~0.base|)) (= |c_ULTIMATE.start_main_~#Dest~0.offset| 0) (= c_ULTIMATE.start_main_~j~0 2) (<= (+ |c_ULTIMATE.start_main_~#Source~0.offset| 8) .cse0) (<= 4 (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0.offset| 8))) (= (select .cse2 |c_ULTIMATE.start_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (= (select .cse1 (+ (* c_ULTIMATE.start_main_~j~0 4) |c_ULTIMATE.start_main_~#Dest~0.offset|)) 4) (= |c_ULTIMATE.start_main_~#Source~0.offset| |c_ULTIMATE.start_main_~#Dest~0.offset|) (< .cse0 (+ |c_ULTIMATE.start_main_~#Source~0.offset| 9)))) is different from false [2021-08-29 10:25:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:25:34,813 INFO L93 Difference]: Finished difference Result 503 states and 668 transitions. [2021-08-29 10:25:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-29 10:25:34,814 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.896551724137931) internal successors, (84), 29 states have internal predecessors, (84), 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 37 [2021-08-29 10:25:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:25:34,816 INFO L225 Difference]: With dead ends: 503 [2021-08-29 10:25:34,816 INFO L226 Difference]: Without dead ends: 485 [2021-08-29 10:25:34,817 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 5881.42ms TimeCoverageRelationStatistics Valid=141, Invalid=640, Unknown=11, NotChecked=540, Total=1332 [2021-08-29 10:25:34,817 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.35ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 49.88ms IncrementalHoareTripleChecker+Time [2021-08-29 10:25:34,817 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 350 Unknown, 0 Unchecked, 0.35ms Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 248 Unchecked, 49.88ms Time] [2021-08-29 10:25:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-08-29 10:25:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 474. [2021-08-29 10:25:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.3446088794926003) internal successors, (636), 473 states have internal predecessors, (636), 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) [2021-08-29 10:25:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 636 transitions. [2021-08-29 10:25:34,865 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 636 transitions. Word has length 37 [2021-08-29 10:25:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:25:34,866 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 636 transitions. [2021-08-29 10:25:34,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.896551724137931) internal successors, (84), 29 states have internal predecessors, (84), 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) [2021-08-29 10:25:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 636 transitions. [2021-08-29 10:25:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 10:25:34,867 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:25:34,867 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:25:34,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-29 10:25:35,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-08-29 10:25:35,081 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:25:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:25:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1630806470, now seen corresponding path program 1 times [2021-08-29 10:25:35,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:25:35,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616487606] [2021-08-29 10:25:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:25:35,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:25:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:25:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 10:25:36,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 10:25:36,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616487606] [2021-08-29 10:25:36,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616487606] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 10:25:36,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773247848] [2021-08-29 10:25:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:25:36,246 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:25:36,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 10:25:36,247 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 10:25:36,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-29 10:25:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 10:25:36,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-29 10:25:36,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 10:25:36,322 INFO L388 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 18 treesize of output 16 [2021-08-29 10:25:36,399 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-08-29 10:25:36,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2021-08-29 10:25:36,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 10:25:36,544 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-08-29 10:25:36,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 50 [2021-08-29 10:25:36,778 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-29 10:25:36,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 55 [2021-08-29 10:25:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 10:25:37,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 10:25:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-29 10:25:49,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773247848] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 10:25:49,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 10:25:49,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-08-29 10:25:49,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157657362] [2021-08-29 10:25:49,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-29 10:25:49,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 10:25:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-29 10:25:49,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=667, Unknown=6, NotChecked=0, Total=812 [2021-08-29 10:25:49,132 INFO L87 Difference]: Start difference. First operand 474 states and 636 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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) [2021-08-29 10:25:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 10:25:52,612 INFO L93 Difference]: Finished difference Result 1022 states and 1299 transitions. [2021-08-29 10:25:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-29 10:25:52,613 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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 38 [2021-08-29 10:25:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 10:25:52,614 INFO L225 Difference]: With dead ends: 1022 [2021-08-29 10:25:52,615 INFO L226 Difference]: Without dead ends: 862 [2021-08-29 10:25:52,616 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 14539.25ms TimeCoverageRelationStatistics Valid=598, Invalid=2476, Unknown=6, NotChecked=0, Total=3080 [2021-08-29 10:25:52,616 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 310 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1103.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.46ms SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 1265.68ms IncrementalHoareTripleChecker+Time [2021-08-29 10:25:52,616 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 0 Invalid, 1295 Unknown, 0 Unchecked, 3.46ms Time], IncrementalHoareTripleChecker [95 Valid, 818 Invalid, 0 Unknown, 382 Unchecked, 1265.68ms Time] [2021-08-29 10:25:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-08-29 10:25:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 487. [2021-08-29 10:25:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 1.323045267489712) internal successors, (643), 486 states have internal predecessors, (643), 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) [2021-08-29 10:25:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 643 transitions. [2021-08-29 10:25:52,665 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 643 transitions. Word has length 38 [2021-08-29 10:25:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 10:25:52,665 INFO L470 AbstractCegarLoop]: Abstraction has 487 states and 643 transitions. [2021-08-29 10:25:52,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 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) [2021-08-29 10:25:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 643 transitions. [2021-08-29 10:25:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 10:25:52,667 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 10:25:52,667 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 10:25:52,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-29 10:25:52,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 10:25:52,885 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 10:25:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 10:25:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 670016120, now seen corresponding path program 1 times [2021-08-29 10:25:52,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 10:25:52,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310686275] [2021-08-29 10:25:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 10:25:52,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 10:25:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 10:25:52,924 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 10:25:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 10:25:52,964 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 10:25:52,964 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 10:25:52,965 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 10:25:52,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-29 10:25:52,971 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 10:25:53,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:25:53 BoogieIcfgContainer [2021-08-29 10:25:53,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 10:25:53,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 10:25:53,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 10:25:53,041 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 10:25:53,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:21:39" (3/4) ... [2021-08-29 10:25:53,043 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 10:25:53,096 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 10:25:53,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 10:25:53,096 INFO L158 Benchmark]: Toolchain (without parser) took 253735.95ms. Allocated memory was 56.6MB in the beginning and 134.2MB in the end (delta: 77.6MB). Free memory was 36.1MB in the beginning and 83.5MB in the end (delta: -47.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2021-08-29 10:25:53,096 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 39.2MB in the beginning and 39.2MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 10:25:53,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.46ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 35.9MB in the beginning and 59.5MB in the end (delta: -23.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2021-08-29 10:25:53,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.29ms. Allocated memory is still 75.5MB. Free memory was 59.3MB in the beginning and 57.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 10:25:53,098 INFO L158 Benchmark]: Boogie Preprocessor took 24.33ms. Allocated memory is still 75.5MB. Free memory was 57.1MB in the beginning and 55.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 10:25:53,099 INFO L158 Benchmark]: RCFGBuilder took 322.70ms. Allocated memory is still 75.5MB. Free memory was 55.4MB in the beginning and 43.3MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-29 10:25:53,102 INFO L158 Benchmark]: TraceAbstraction took 253046.97ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 42.8MB in the beginning and 87.7MB in the end (delta: -44.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2021-08-29 10:25:53,103 INFO L158 Benchmark]: Witness Printer took 55.37ms. Allocated memory is still 134.2MB. Free memory was 87.7MB in the beginning and 83.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 10:25:53,104 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.18ms. Allocated memory is still 56.6MB. Free memory was 39.2MB in the beginning and 39.2MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.46ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 35.9MB in the beginning and 59.5MB in the end (delta: -23.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.29ms. Allocated memory is still 75.5MB. Free memory was 59.3MB in the beginning and 57.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.33ms. Allocated memory is still 75.5MB. Free memory was 57.1MB in the beginning and 55.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.70ms. Allocated memory is still 75.5MB. Free memory was 55.4MB in the beginning and 43.3MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 253046.97ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 42.8MB in the beginning and 87.7MB in the end (delta: -44.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Witness Printer took 55.37ms. Allocated memory is still 134.2MB. Free memory was 87.7MB in the beginning and 83.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int INFINITY = 899; VAL [INFINITY=899] [L18] int nodecount = __VERIFIER_nondet_int(); [L19] int edgecount = __VERIFIER_nondet_int(); [L20] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [INFINITY=899] [L21] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L22] int source = 0; [L23] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L24] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L25] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L26] int distance[5]; [L27] int x,y; [L28] int i,j; [L30] i = 0 VAL [INFINITY=899] [L30] COND TRUE i < nodecount VAL [INFINITY=899] [L31] COND TRUE i == source [L32] distance[i] = 0 VAL [INFINITY=899] [L30] i++ VAL [INFINITY=899] [L30] COND TRUE i < nodecount VAL [INFINITY=899] [L31] COND FALSE !(i == source) [L35] distance[i] = INFINITY VAL [INFINITY=899] [L30] i++ VAL [INFINITY=899] [L30] COND FALSE !(i < nodecount) VAL [INFINITY=899] [L39] i = 0 VAL [INFINITY=899] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [INFINITY=899] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [INFINITY=899] [L45] COND TRUE distance[x] > distance[y] + Weight[j] [L47] distance[x] = -1 VAL [INFINITY=899] [L41] j++ VAL [INFINITY=899] [L41] COND FALSE !(j < edgecount) VAL [INFINITY=899] [L39] i++ VAL [INFINITY=899] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [INFINITY=899] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [INFINITY=899] [L45] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L41] j++ VAL [INFINITY=899] [L41] COND FALSE !(j < edgecount) VAL [INFINITY=899] [L39] i++ VAL [INFINITY=899] [L39] COND FALSE !(i < nodecount) VAL [INFINITY=899] [L51] i = 0 VAL [INFINITY=899] [L51] COND TRUE i < edgecount [L53] EXPR Dest[i] [L53] x = Dest[i] [L54] EXPR Source[i] [L54] y = Source[i] [L55] EXPR distance[x] [L55] EXPR distance[y] [L55] EXPR Weight[i] VAL [INFINITY=899] [L55] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L51] i++ VAL [INFINITY=899] [L51] COND FALSE !(i < edgecount) VAL [INFINITY=899] [L61] i = 0 VAL [INFINITY=899] [L61] COND TRUE i < nodecount [L63] distance[i] [L11] COND FALSE !(!(cond)) VAL [INFINITY=899] [L61] i++ VAL [INFINITY=899] [L61] COND TRUE i < nodecount [L63] distance[i] [L11] COND TRUE !(cond) VAL [INFINITY=899] [L12] reach_error() VAL [INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 252916.04ms, OverallIterations: 26, TraceHistogramMax: 3, EmptinessCheckTime: 42.59ms, AutomataDifference: 92114.70ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 8.62ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2345 SdHoareTripleChecker+Valid, 4756.62ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2345 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3902.85ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2918 IncrementalHoareTripleChecker+Unchecked, 3829 mSDsCounter, 848 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6848 IncrementalHoareTripleChecker+Invalid, 10614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 848 mSolverCounterUnsat, 0 mSDtfsCounter, 6848 mSolverCounterSat, 38.50ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1794 GetRequests, 1030 SyntacticMatches, 46 SemanticMatches, 718 ConstructedPredicates, 72 IntricatePredicates, 0 DeprecatedPredicates, 7735 ImplicationChecksByTransitivity, 215547.48ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=25, InterpolantAutomatonStates: 391, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 524.63ms AutomataMinimizationTime, 25 MinimizatonAttempts, 1380 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 253.08ms SsaConstructionTime, 2029.20ms SatisfiabilityAnalysisTime, 152333.33ms InterpolantComputationTime, 1453 NumberOfCodeBlocks, 1438 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1994 ConstructedInterpolants, 351 QuantifiedInterpolants, 40487 SizeOfPredicates, 278 NumberOfNonLiveVariables, 5799 ConjunctsInSsa, 454 ConjunctsInUnsatCore, 68 InterpolantComputations, 4 PerfectInterpolantSequences, 400/987 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 10:25:53,332 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-29 10:25:53,352 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 137 Received shutdown request...