/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/n.c40.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:05:59,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:05:59,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:05:59,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:05:59,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:05:59,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:05:59,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:05:59,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:05:59,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:05:59,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:05:59,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:05:59,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:05:59,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:05:59,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:05:59,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:05:59,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:05:59,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:05:59,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:05:59,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:05:59,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:05:59,548 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:05:59,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:05:59,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:05:59,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:05:59,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:05:59,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:05:59,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:05:59,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:05:59,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:05:59,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:05:59,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:05:59,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:05:59,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:05:59,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:05:59,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:05:59,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:05:59,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:05:59,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:05:59,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:05:59,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:05:59,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:05:59,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:05:59,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:05:59,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:05:59,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:05:59,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:05:59,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:05:59,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:05:59,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:05:59,595 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:05:59,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:05:59,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:05:59,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:05:59,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:05:59,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:05:59,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:05:59,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:05:59,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:05:59,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:05:59,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:05:59,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:05:59,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:05:59,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:59,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:05:59,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:05:59,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:05:59,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:05:59,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:05:59,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:05:59,598 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:05:59,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:05:59,599 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:05:59,600 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:05:59,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:05:59,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:05:59,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:05:59,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:05:59,841 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:05:59,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c40.c [2022-04-27 21:05:59,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94ba510e/d876c24ea9934ea7ae7ae51f72ed84a3/FLAG78c1baf34 [2022-04-27 21:06:00,258 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:06:00,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c [2022-04-27 21:06:00,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94ba510e/d876c24ea9934ea7ae7ae51f72ed84a3/FLAG78c1baf34 [2022-04-27 21:06:00,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94ba510e/d876c24ea9934ea7ae7ae51f72ed84a3 [2022-04-27 21:06:00,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:06:00,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:06:00,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:06:00,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:06:00,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:06:00,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe05a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00, skipping insertion in model container [2022-04-27 21:06:00,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:06:00,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:06:00,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c[498,511] [2022-04-27 21:06:00,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:06:00,921 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:06:00,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c[498,511] [2022-04-27 21:06:00,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:06:00,946 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:06:00,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00 WrapperNode [2022-04-27 21:06:00,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:06:00,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:06:00,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:06:00,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:06:00,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:06:00,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:06:00,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:06:00,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:06:00,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (1/1) ... [2022-04-27 21:06:00,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:06:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:06:01,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:06:01,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:06:01,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:06:01,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:06:01,039 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:06:01,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:06:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:06:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:06:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:06:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:06:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:06:01,097 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:06:01,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:06:01,259 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:06:01,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:06:01,265 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:06:01,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:06:01 BoogieIcfgContainer [2022-04-27 21:06:01,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:06:01,267 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:06:01,267 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:06:01,268 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:06:01,271 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:06:01" (1/1) ... [2022-04-27 21:06:01,272 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:06:01,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:06:01 BasicIcfg [2022-04-27 21:06:01,290 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:06:01,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:06:01,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:06:01,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:06:01,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:06:00" (1/4) ... [2022-04-27 21:06:01,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2bce62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:06:01, skipping insertion in model container [2022-04-27 21:06:01,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:06:00" (2/4) ... [2022-04-27 21:06:01,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2bce62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:06:01, skipping insertion in model container [2022-04-27 21:06:01,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:06:01" (3/4) ... [2022-04-27 21:06:01,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2bce62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:06:01, skipping insertion in model container [2022-04-27 21:06:01,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:06:01" (4/4) ... [2022-04-27 21:06:01,297 INFO L111 eAbstractionObserver]: Analyzing ICFG n.c40.cqvasr [2022-04-27 21:06:01,308 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:06:01,308 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:06:01,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:06:01,348 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22286ad5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26ed50e4 [2022-04-27 21:06:01,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:06:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:06:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:06:01,360 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:06:01,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:06:01,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:06:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:06:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1525854499, now seen corresponding path program 1 times [2022-04-27 21:06:01,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:06:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569200010] [2022-04-27 21:06:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:06:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:06:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:06:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:01,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {21#true} is VALID [2022-04-27 21:06:01,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:06:01,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:06:01,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [43] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:06:01,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {21#true} is VALID [2022-04-27 21:06:01,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:06:01,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:06:01,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [44] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 21:06:01,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [47] mainENTRY-->L14-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_7) (= v_~i~0_7 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_7, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {21#true} is VALID [2022-04-27 21:06:01,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [49] L14-3-->L14-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 21:06:01,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} [51] L14-4-->L20: Formula: (= (store |v_#memory_int_12| |v_~#y~0.base_5| (store (select |v_#memory_int_12| |v_~#y~0.base_5|) (+ v_~i~0_11 |v_~#y~0.offset_5|) 0)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} AuxVars[] AssignedVars[#memory_int] {22#false} is VALID [2022-04-27 21:06:01,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [54] L20-->L21: Formula: (and (< v_~k~0_8 v_~i~0_12) (= |v_main_#t~mem8_3| (select (select |v_#memory_int_13| |v_~#y~0.base_6|) (+ |v_~#y~0.offset_6| v_~k~0_8))) (<= 0 v_~k~0_8)) InVars {~k~0=v_~k~0_8, #memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_6|, ~#y~0.base=|v_~#y~0.base_6|, ~i~0=v_~i~0_12} OutVars{~k~0=v_~k~0_8, ~#y~0.offset=|v_~#y~0.offset_6|, ~i~0=v_~i~0_12, #memory_int=|v_#memory_int_13|, main_#t~mem8=|v_main_#t~mem8_3|, ~#y~0.base=|v_~#y~0.base_6|} AuxVars[] AssignedVars[main_#t~mem8] {22#false} is VALID [2022-04-27 21:06:01,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [56] L21-->L22: Formula: (= |v_main_#t~mem8_5| 0) InVars {main_#t~mem8=|v_main_#t~mem8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {22#false} is VALID [2022-04-27 21:06:01,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [59] L22-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 21:06:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:06:01,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:06:01,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569200010] [2022-04-27 21:06:01,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569200010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:06:01,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:06:01,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:06:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476891477] [2022-04-27 21:06:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:06:01,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:06:01,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:06:01,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:06:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:06:01,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:06:01,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:06:01,688 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:01,789 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 21:06:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:06:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:06:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:06:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 21:06:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 21:06:01,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 21:06:01,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:01,856 INFO L225 Difference]: With dead ends: 28 [2022-04-27 21:06:01,856 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 21:06:01,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:06:01,862 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:06:01,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:06:01,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 21:06:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 21:06:01,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:06:01,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,890 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,890 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:01,894 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:06:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:06:01,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:01,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:01,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 21:06:01,895 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 21:06:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:01,897 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:06:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:06:01,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:01,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:01,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:06:01,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:06:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 21:06:01,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 21:06:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:06:01,903 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 21:06:01,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:06:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:06:01,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:06:01,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:06:01,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:06:01,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:06:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:06:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash 86310556, now seen corresponding path program 1 times [2022-04-27 21:06:01,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:06:01,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490239636] [2022-04-27 21:06:01,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:06:01,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:06:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:06:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:02,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {106#true} is VALID [2022-04-27 21:06:02,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 21:06:02,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 21:06:02,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {106#true} [43] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:06:02,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {106#true} is VALID [2022-04-27 21:06:02,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 21:06:02,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#true} {106#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 21:06:02,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {106#true} [44] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 21:06:02,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {106#true} [47] mainENTRY-->L14-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_7) (= v_~i~0_7 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_7, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {111#(= ~i~0 0)} is VALID [2022-04-27 21:06:02,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#(= ~i~0 0)} [50] L14-3-->L14-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_8| |v_~#x~0.base_4|) (+ |v_~#x~0.offset_4| v_~i~0_8))) InVars {~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} OutVars{~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} AuxVars[] AssignedVars[main_#t~mem5] {111#(= ~i~0 0)} is VALID [2022-04-27 21:06:02,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#(= ~i~0 0)} [52] L14-1-->L14-4: Formula: (= |v_main_#t~mem5_3| 0) InVars {main_#t~mem5=|v_main_#t~mem5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem5] {111#(= ~i~0 0)} is VALID [2022-04-27 21:06:02,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#(= ~i~0 0)} [51] L14-4-->L20: Formula: (= (store |v_#memory_int_12| |v_~#y~0.base_5| (store (select |v_#memory_int_12| |v_~#y~0.base_5|) (+ v_~i~0_11 |v_~#y~0.offset_5|) 0)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} AuxVars[] AssignedVars[#memory_int] {111#(= ~i~0 0)} is VALID [2022-04-27 21:06:02,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#(= ~i~0 0)} [54] L20-->L21: Formula: (and (< v_~k~0_8 v_~i~0_12) (= |v_main_#t~mem8_3| (select (select |v_#memory_int_13| |v_~#y~0.base_6|) (+ |v_~#y~0.offset_6| v_~k~0_8))) (<= 0 v_~k~0_8)) InVars {~k~0=v_~k~0_8, #memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_6|, ~#y~0.base=|v_~#y~0.base_6|, ~i~0=v_~i~0_12} OutVars{~k~0=v_~k~0_8, ~#y~0.offset=|v_~#y~0.offset_6|, ~i~0=v_~i~0_12, #memory_int=|v_#memory_int_13|, main_#t~mem8=|v_main_#t~mem8_3|, ~#y~0.base=|v_~#y~0.base_6|} AuxVars[] AssignedVars[main_#t~mem8] {107#false} is VALID [2022-04-27 21:06:02,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {107#false} [56] L21-->L22: Formula: (= |v_main_#t~mem8_5| 0) InVars {main_#t~mem8=|v_main_#t~mem8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {107#false} is VALID [2022-04-27 21:06:02,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {107#false} [59] L22-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#false} is VALID [2022-04-27 21:06:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:06:02,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:06:02,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490239636] [2022-04-27 21:06:02,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490239636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:06:02,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:06:02,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:06:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480757772] [2022-04-27 21:06:02,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:06:02,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:06:02,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:06:02,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:02,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:06:02,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:06:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:06:02,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:06:02,082 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:02,168 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 21:06:02,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:06:02,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:06:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:06:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-27 21:06:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-27 21:06:02,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-27 21:06:02,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:02,197 INFO L225 Difference]: With dead ends: 20 [2022-04-27 21:06:02,197 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:06:02,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:06:02,199 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:06:02,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:06:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:06:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:06:02,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:06:02,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,206 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,206 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:02,208 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:06:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:06:02,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:02,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:02,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:06:02,209 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:06:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:02,211 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:06:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:06:02,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:02,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:02,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:06:02,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:06:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 21:06:02,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 21:06:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:06:02,214 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 21:06:02,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:06:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:06:02,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:06:02,215 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:06:02,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:06:02,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:06:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:06:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2098026081, now seen corresponding path program 1 times [2022-04-27 21:06:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:06:02,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593578371] [2022-04-27 21:06:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:06:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:06:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:02,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:06:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:02,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-27 21:06:02,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-27 21:06:02,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} {194#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 21:06:02,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} [43] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:06:02,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [45] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= (select |v_#valid_1| 5) 1) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#x~0.offset_1| 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_~#y~0.offset_1| 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 5 |v_~#y~0.base_1|) (= 100 (select |v_#length_1| 4)) (= v_~i~0_1 0) (= v_~k~0_1 0) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= (select |v_#length_1| 5) 100) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_3| |v_~#x~0.base_1| .cse1) |v_~#y~0.base_1| .cse1)) |v_#memory_int_1|) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_~#x~0.base_1| 4) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_1, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_1, ~#x~0.offset=|v_~#x~0.offset_1|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_1|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, ~#x~0.base=|v_~#x~0.base_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-27 21:06:02,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} [48] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} is VALID [2022-04-27 21:06:02,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= |~#x~0.base| 4))} {194#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 21:06:02,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} [44] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 21:06:02,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} [47] mainENTRY-->L14-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_7) (= v_~i~0_7 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_7, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {200#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 21:06:02,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (not (= |~#x~0.base| 5)))} [50] L14-3-->L14-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_8| |v_~#x~0.base_4|) (+ |v_~#x~0.offset_4| v_~i~0_8))) InVars {~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} OutVars{~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} AuxVars[] AssignedVars[main_#t~mem5] {201#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (= |main_#t~mem5| 0) (not (= |~#x~0.base| 5)))} is VALID [2022-04-27 21:06:02,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (= |main_#t~mem5| 0) (not (= |~#x~0.base| 5)))} [53] L14-1-->L14-3: Formula: (and (= (store |v_#memory_int_10| |v_~#y~0.base_4| (store (select |v_#memory_int_10| |v_~#y~0.base_4|) (+ v_~i~0_10 |v_~#y~0.offset_4|) (select (select |v_#memory_int_10| |v_~#x~0.base_5|) (+ v_~i~0_10 |v_~#x~0.offset_5|)))) |v_#memory_int_9|) (not (= |v_main_#t~mem5_5| 0)) (= (+ v_~i~0_10 1) v_~i~0_9)) InVars {~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_10, ~#x~0.offset=|v_~#x~0.offset_5|, #memory_int=|v_#memory_int_10|, ~#x~0.base=|v_~#x~0.base_5|, main_#t~mem5=|v_main_#t~mem5_5|, ~#y~0.base=|v_~#y~0.base_4|} OutVars{~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_9, ~#x~0.offset=|v_~#x~0.offset_5|, #memory_int=|v_#memory_int_9|, ~#x~0.base=|v_~#x~0.base_5|, main_#t~mem6=|v_main_#t~mem6_1|, ~#y~0.base=|v_~#y~0.base_4|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~i~0, #memory_int, main_#t~mem5, main_#t~mem6, main_#t~post7] {195#false} is VALID [2022-04-27 21:06:02,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#false} [50] L14-3-->L14-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_8| |v_~#x~0.base_4|) (+ |v_~#x~0.offset_4| v_~i~0_8))) InVars {~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} OutVars{~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_8|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_4|, ~i~0=v_~i~0_8} AuxVars[] AssignedVars[main_#t~mem5] {195#false} is VALID [2022-04-27 21:06:02,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#false} [52] L14-1-->L14-4: Formula: (= |v_main_#t~mem5_3| 0) InVars {main_#t~mem5=|v_main_#t~mem5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem5] {195#false} is VALID [2022-04-27 21:06:02,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {195#false} [51] L14-4-->L20: Formula: (= (store |v_#memory_int_12| |v_~#y~0.base_5| (store (select |v_#memory_int_12| |v_~#y~0.base_5|) (+ v_~i~0_11 |v_~#y~0.offset_5|) 0)) |v_#memory_int_11|) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_5|, ~#y~0.base=|v_~#y~0.base_5|, ~i~0=v_~i~0_11} AuxVars[] AssignedVars[#memory_int] {195#false} is VALID [2022-04-27 21:06:02,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#false} [54] L20-->L21: Formula: (and (< v_~k~0_8 v_~i~0_12) (= |v_main_#t~mem8_3| (select (select |v_#memory_int_13| |v_~#y~0.base_6|) (+ |v_~#y~0.offset_6| v_~k~0_8))) (<= 0 v_~k~0_8)) InVars {~k~0=v_~k~0_8, #memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_6|, ~#y~0.base=|v_~#y~0.base_6|, ~i~0=v_~i~0_12} OutVars{~k~0=v_~k~0_8, ~#y~0.offset=|v_~#y~0.offset_6|, ~i~0=v_~i~0_12, #memory_int=|v_#memory_int_13|, main_#t~mem8=|v_main_#t~mem8_3|, ~#y~0.base=|v_~#y~0.base_6|} AuxVars[] AssignedVars[main_#t~mem8] {195#false} is VALID [2022-04-27 21:06:02,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#false} [56] L21-->L22: Formula: (= |v_main_#t~mem8_5| 0) InVars {main_#t~mem8=|v_main_#t~mem8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {195#false} is VALID [2022-04-27 21:06:02,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#false} [59] L22-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#false} is VALID [2022-04-27 21:06:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:06:02,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:06:02,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593578371] [2022-04-27 21:06:02,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593578371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:06:02,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:06:02,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:06:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846721290] [2022-04-27 21:06:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:06:02,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:06:02,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:06:02,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:02,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:06:02,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:06:02,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:06:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:06:02,491 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:02,579 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:06:02,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:06:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:06:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:06:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-27 21:06:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-27 21:06:02,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-04-27 21:06:02,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:02,596 INFO L225 Difference]: With dead ends: 15 [2022-04-27 21:06:02,596 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:06:02,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:06:02,597 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:06:02,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:06:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:06:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:06:02,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:06:02,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:06:02,598 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:06:02,598 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:06:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:02,598 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:06:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:06:02,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:02,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:02,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-27 21:06:02,599 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-27 21:06:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:02,599 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:06:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:06:02,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:02,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:02,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:06:02,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:06:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:06:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:06:02,600 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 21:06:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:06:02,600 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:06:02,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:06:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:06:02,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:02,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:06:02,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:06:02,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:06:02,693 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:06:02,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:06:02,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:06:02,694 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:06:02,694 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (= 5 |~#y~0.base|) (= ~i~0 0) (= |~#x~0.base| 4)) [2022-04-27 21:06:02,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:06:02,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:06:02,694 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 10 25) the Hoare annotation is: (or (not (= |~#x~0.base| 4)) (not (= 5 |~#y~0.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0)) (and (= ~i~0 0) (= |#memory_int| |old(#memory_int)|) (= ~k~0 |old(~k~0)|))) [2022-04-27 21:06:02,697 INFO L895 garLoopResultBuilder]: At program point L14-3(lines 14 17) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= |~#x~0.base| 4)) (and (= .cse0 (select |#memory_int| |~#x~0.base|)) (= ~i~0 0)) (not (= 5 |~#y~0.base|)) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0)))) [2022-04-27 21:06:02,697 INFO L899 garLoopResultBuilder]: For program point L14-4(lines 14 17) no Hoare annotation was computed. [2022-04-27 21:06:02,697 INFO L899 garLoopResultBuilder]: For program point L14-1(lines 14 17) no Hoare annotation was computed. [2022-04-27 21:06:02,697 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2022-04-27 21:06:02,697 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 22) no Hoare annotation was computed. [2022-04-27 21:06:02,697 INFO L899 garLoopResultBuilder]: For program point L20-1(lines 20 22) no Hoare annotation was computed. [2022-04-27 21:06:02,697 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-27 21:06:02,697 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 10 25) no Hoare annotation was computed. [2022-04-27 21:06:02,698 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 22) no Hoare annotation was computed. [2022-04-27 21:06:02,698 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 10 25) no Hoare annotation was computed. [2022-04-27 21:06:02,700 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 21:06:02,702 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:06:02,712 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:06:02,714 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:06:02,714 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2022-04-27 21:06:02,714 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-04-27 21:06:02,714 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:06:02,714 WARN L170 areAnnotationChecker]: L14-4 has no Hoare annotation [2022-04-27 21:06:02,714 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-04-27 21:06:02,714 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:06:02,715 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:06:02,716 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:06:02,719 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 21:06:02,731 INFO L158 Benchmark]: Toolchain (without parser) took 2043.39ms. Allocated memory was 168.8MB in the beginning and 227.5MB in the end (delta: 58.7MB). Free memory was 112.7MB in the beginning and 165.1MB in the end (delta: -52.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-04-27 21:06:02,731 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 168.8MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:06:02,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.09ms. Allocated memory was 168.8MB in the beginning and 227.5MB in the end (delta: 58.7MB). Free memory was 112.6MB in the beginning and 200.1MB in the end (delta: -87.5MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2022-04-27 21:06:02,732 INFO L158 Benchmark]: Boogie Preprocessor took 30.40ms. Allocated memory is still 227.5MB. Free memory was 200.1MB in the beginning and 198.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:06:02,732 INFO L158 Benchmark]: RCFGBuilder took 287.61ms. Allocated memory is still 227.5MB. Free memory was 198.5MB in the beginning and 187.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:06:02,732 INFO L158 Benchmark]: IcfgTransformer took 22.87ms. Allocated memory is still 227.5MB. Free memory was 187.0MB in the beginning and 186.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:06:02,732 INFO L158 Benchmark]: TraceAbstraction took 1438.30ms. Allocated memory is still 227.5MB. Free memory was 185.4MB in the beginning and 165.1MB in the end (delta: 20.3MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. [2022-04-27 21:06:02,734 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 168.8MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.09ms. Allocated memory was 168.8MB in the beginning and 227.5MB in the end (delta: 58.7MB). Free memory was 112.6MB in the beginning and 200.1MB in the end (delta: -87.5MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.40ms. Allocated memory is still 227.5MB. Free memory was 200.1MB in the beginning and 198.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 287.61ms. Allocated memory is still 227.5MB. Free memory was 198.5MB in the beginning and 187.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 22.87ms. Allocated memory is still 227.5MB. Free memory was 187.0MB in the beginning and 186.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1438.30ms. Allocated memory is still 227.5MB. Free memory was 185.4MB in the beginning and 165.1MB in the end (delta: 20.3MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 32 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 6 NumberOfFragments, 108 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 21:06:02,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...