/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/nla-digbench-scaling/geo3-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:13:08,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:13:08,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:13:08,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:13:08,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:13:08,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:13:08,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:13:08,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:13:08,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:13:08,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:13:08,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:13:08,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:13:08,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:13:08,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:13:08,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:13:08,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:13:08,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:13:08,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:13:08,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:13:08,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:13:08,944 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:13:08,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:13:08,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:13:08,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:13:08,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:13:08,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:13:08,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:13:08,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:13:08,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:13:08,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:13:08,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:13:08,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:13:08,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:13:08,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:13:08,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:13:08,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:13:08,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:13:08,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:13:08,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:13:08,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:13:08,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:13:08,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:13:08,962 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 03:13:08,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:13:08,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:13:08,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:13:08,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:13:08,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:13:08,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:13:08,999 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:13:08,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:13:08,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:13:08,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:13:09,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:13:09,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:13:09,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:13:09,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:13:09,000 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:13:09,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:13:09,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:13:09,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:13:09,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:13:09,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:13:09,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:13:09,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:13:09,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:13:09,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:13:09,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:13:09,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:13:09,001 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:13:09,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:13:09,016 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:13:09,016 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-15 03:13:09,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:13:09,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:13:09,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:13:09,270 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:13:09,271 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:13:09,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound5.c [2022-04-15 03:13:09,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37051910/f5669a1a82c145dc9385024be7795514/FLAGe562cf388 [2022-04-15 03:13:09,766 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:13:09,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound5.c [2022-04-15 03:13:09,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37051910/f5669a1a82c145dc9385024be7795514/FLAGe562cf388 [2022-04-15 03:13:09,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37051910/f5669a1a82c145dc9385024be7795514 [2022-04-15 03:13:09,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:13:09,795 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:13:09,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:13:09,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:13:09,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:13:09,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:13:09" (1/1) ... [2022-04-15 03:13:09,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3543a10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:09, skipping insertion in model container [2022-04-15 03:13:09,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:13:09" (1/1) ... [2022-04-15 03:13:09,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:13:09,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:13:10,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound5.c[525,538] [2022-04-15 03:13:10,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:13:10,046 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:13:10,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound5.c[525,538] [2022-04-15 03:13:10,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:13:10,081 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:13:10,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10 WrapperNode [2022-04-15 03:13:10,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:13:10,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:13:10,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:13:10,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:13:10,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:13:10,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:13:10,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:13:10,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:13:10,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:13:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:10,155 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-15 03:13:10,187 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-15 03:13:10,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:13:10,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:13:10,199 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:13:10,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:13:10,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:13:10,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:13:10,200 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:13:10,201 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:13:10,201 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:13:10,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:13:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:13:10,280 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:13:10,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:13:10,483 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:13:10,506 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:13:10,506 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 03:13:10,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:10 BoogieIcfgContainer [2022-04-15 03:13:10,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:13:10,508 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:13:10,508 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:13:10,509 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:13:10,511 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:10" (1/1) ... [2022-04-15 03:13:10,519 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:13:10,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:13:10 BasicIcfg [2022-04-15 03:13:10,542 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:13:10,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:13:10,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:13:10,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:13:10,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:13:09" (1/4) ... [2022-04-15 03:13:10,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e71e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:13:10, skipping insertion in model container [2022-04-15 03:13:10,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:10" (2/4) ... [2022-04-15 03:13:10,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e71e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:13:10, skipping insertion in model container [2022-04-15 03:13:10,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:10" (3/4) ... [2022-04-15 03:13:10,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e71e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:13:10, skipping insertion in model container [2022-04-15 03:13:10,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:13:10" (4/4) ... [2022-04-15 03:13:10,547 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound5.cqvasr [2022-04-15 03:13:10,550 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:13:10,550 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:13:10,630 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:13:10,648 INFO L340 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 [2022-04-15 03:13:10,649 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:13:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 03:13:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 03:13:10,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:10,689 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:10,692 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -630084848, now seen corresponding path program 1 times [2022-04-15 03:13:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:10,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213412503] [2022-04-15 03:13:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:10,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:10,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273571613] [2022-04-15 03:13:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:10,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:10,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:10,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:13:10,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 03:13:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:10,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 03:13:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:10,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:10,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:13:10,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 03:13:10,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:13:10,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:13:10,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 03:13:10,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {25#true} is VALID [2022-04-15 03:13:10,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [63] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 03:13:10,910 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_10 v_main_~z~0_8) (* (- 1) v_main_~x~0_10) v_main_~a~0_8 (* (- 1) (* v_main_~y~0_9 v_main_~az~0_7))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~az~0=v_main_~az~0_7, main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {26#false} is VALID [2022-04-15 03:13:10,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-15 03:13:10,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 03:13:10,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 03:13:10,911 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-15 03:13:10,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:13:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:10,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213412503] [2022-04-15 03:13:10,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:10,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273571613] [2022-04-15 03:13:10,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273571613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:13:10,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:13:10,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 03:13:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120184710] [2022-04-15 03:13:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:13:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 03:13:10,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:10,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:10,935 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-15 03:13:10,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 03:13:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 03:13:10,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 03:13:10,957 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:11,002 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 03:13:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 03:13:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 03:13:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-15 03:13:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-15 03:13:11,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-04-15 03:13:11,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:11,073 INFO L225 Difference]: With dead ends: 38 [2022-04-15 03:13:11,074 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 03:13:11,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 03:13:11,080 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:13:11,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:13:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 03:13:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 03:13:11,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:11,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:13:11,107 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:13:11,107 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:13:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:11,111 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 03:13:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 03:13:11,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:11,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:11,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 03:13:11,112 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 03:13:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:11,115 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 03:13:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 03:13:11,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:11,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:11,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:11,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:13:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 03:13:11,127 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 03:13:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:11,128 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 03:13:11,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 03:13:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 03:13:11,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:11,128 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:11,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 03:13:11,346 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 03:13:11,347 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1971636769, now seen corresponding path program 1 times [2022-04-15 03:13:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:11,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397970278] [2022-04-15 03:13:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:11,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:11,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912468270] [2022-04-15 03:13:11,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:11,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:11,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:13:11,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 03:13:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:11,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 03:13:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:11,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:11,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168#true} is VALID [2022-04-15 03:13:11,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {176#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:11,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:11,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#(<= ~counter~0 0)} {168#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:11,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:11,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#(<= ~counter~0 0)} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {176#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:11,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(<= ~counter~0 0)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {192#(<= |main_#t~post7| 0)} is VALID [2022-04-15 03:13:11,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(<= |main_#t~post7| 0)} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 5)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {169#false} is VALID [2022-04-15 03:13:11,636 INFO L272 TraceCheckUtils]: 8: Hoare triple {169#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_10 v_main_~z~0_8) (* (- 1) v_main_~x~0_10) v_main_~a~0_8 (* (- 1) (* v_main_~y~0_9 v_main_~az~0_7))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~az~0=v_main_~az~0_7, main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {169#false} is VALID [2022-04-15 03:13:11,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {169#false} is VALID [2022-04-15 03:13:11,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {169#false} is VALID [2022-04-15 03:13:11,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#false} is VALID [2022-04-15 03:13:11,636 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-15 03:13:11,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:13:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:11,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397970278] [2022-04-15 03:13:11,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:11,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912468270] [2022-04-15 03:13:11,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912468270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:13:11,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:13:11,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 03:13:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093141947] [2022-04-15 03:13:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:13:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 03:13:11,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:11,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,672 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-15 03:13:11,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 03:13:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:11,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 03:13:11,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:13:11,674 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:11,720 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 03:13:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 03:13:11,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 03:13:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 03:13:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 03:13:11,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 03:13:11,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:11,749 INFO L225 Difference]: With dead ends: 26 [2022-04-15 03:13:11,749 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 03:13:11,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:13:11,750 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:13:11,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:13:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 03:13:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 03:13:11,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:11,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:13:11,755 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:13:11,755 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:13:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:11,756 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 03:13:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:13:11,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:11,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:11,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 03:13:11,757 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 03:13:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:11,758 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 03:13:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:13:11,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:11,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:11,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:11,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 03:13:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 03:13:11,760 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-15 03:13:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:11,760 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 03:13:11,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:13:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 03:13:11,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:11,761 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:11,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 03:13:11,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 03:13:11,975 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1972709245, now seen corresponding path program 1 times [2022-04-15 03:13:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:11,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250737729] [2022-04-15 03:13:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:11,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:11,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:11,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830853312] [2022-04-15 03:13:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:11,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:11,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:11,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:13:11,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 03:13:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:12,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 03:13:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:12,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:12,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {310#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#true} is VALID [2022-04-15 03:13:12,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {310#true} is VALID [2022-04-15 03:13:12,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#true} is VALID [2022-04-15 03:13:12,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#true} is VALID [2022-04-15 03:13:12,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#true} is VALID [2022-04-15 03:13:12,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:12,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:12,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 5) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:12,245 INFO L272 TraceCheckUtils]: 8: Hoare triple {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {340#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:13:12,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {344#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:13:12,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {311#false} is VALID [2022-04-15 03:13:12,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#false} is VALID [2022-04-15 03:13:12,247 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-15 03:13:12,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:13:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:12,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250737729] [2022-04-15 03:13:12,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:12,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830853312] [2022-04-15 03:13:12,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830853312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:13:12,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:13:12,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 03:13:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632478254] [2022-04-15 03:13:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:13:12,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 03:13:12,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:12,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:12,273 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-15 03:13:12,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:13:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:13:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:13:12,274 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:12,412 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 03:13:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:13:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 03:13:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 03:13:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 03:13:12,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 03:13:12,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:12,464 INFO L225 Difference]: With dead ends: 28 [2022-04-15 03:13:12,464 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 03:13:12,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 03:13:12,466 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:13:12,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:13:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 03:13:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 03:13:12,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:12,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 03:13:12,499 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 03:13:12,499 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 03:13:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:12,501 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 03:13:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 03:13:12,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:12,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:12,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 03:13:12,502 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 03:13:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:12,512 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 03:13:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 03:13:12,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:12,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:12,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:12,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 03:13:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 03:13:12,515 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-15 03:13:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:12,515 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 03:13:12,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 03:13:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 03:13:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 03:13:12,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:12,518 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:12,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 03:13:12,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:12,736 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash -832305310, now seen corresponding path program 1 times [2022-04-15 03:13:12,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:12,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932909567] [2022-04-15 03:13:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:12,752 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:12,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675020431] [2022-04-15 03:13:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:12,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:12,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:13:12,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 03:13:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:12,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 03:13:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:12,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:12,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:13:12,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {486#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:12,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:12,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {486#(<= ~counter~0 0)} {478#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:12,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {486#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:12,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {486#(<= ~counter~0 0)} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {486#(<= ~counter~0 0)} is VALID [2022-04-15 03:13:12,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(<= ~counter~0 0)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {502#(<= ~counter~0 1)} is VALID [2022-04-15 03:13:12,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#(<= ~counter~0 1)} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 5) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {502#(<= ~counter~0 1)} is VALID [2022-04-15 03:13:12,987 INFO L272 TraceCheckUtils]: 8: Hoare triple {502#(<= ~counter~0 1)} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {502#(<= ~counter~0 1)} is VALID [2022-04-15 03:13:12,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#(<= ~counter~0 1)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {502#(<= ~counter~0 1)} is VALID [2022-04-15 03:13:12,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {502#(<= ~counter~0 1)} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {502#(<= ~counter~0 1)} is VALID [2022-04-15 03:13:12,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(<= ~counter~0 1)} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {502#(<= ~counter~0 1)} is VALID [2022-04-15 03:13:12,990 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {502#(<= ~counter~0 1)} {502#(<= ~counter~0 1)} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {502#(<= ~counter~0 1)} is VALID [2022-04-15 03:13:12,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#(<= ~counter~0 1)} [75] L35-1-->L34-3: Formula: (and (= (+ v_main_~a~0_5 (* v_main_~x~0_6 v_main_~z~0_5)) v_main_~x~0_5) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_5)) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {502#(<= ~counter~0 1)} is VALID [2022-04-15 03:13:12,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#(<= ~counter~0 1)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {527#(<= |main_#t~post7| 1)} is VALID [2022-04-15 03:13:12,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {527#(<= |main_#t~post7| 1)} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 5)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {479#false} is VALID [2022-04-15 03:13:12,996 INFO L272 TraceCheckUtils]: 16: Hoare triple {479#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_10 v_main_~z~0_8) (* (- 1) v_main_~x~0_10) v_main_~a~0_8 (* (- 1) (* v_main_~y~0_9 v_main_~az~0_7))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~az~0=v_main_~az~0_7, main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {479#false} is VALID [2022-04-15 03:13:12,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {479#false} is VALID [2022-04-15 03:13:12,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {479#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-15 03:13:12,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {479#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-15 03:13:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 03:13:12,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:13:13,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {479#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-15 03:13:13,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {479#false} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {479#false} is VALID [2022-04-15 03:13:13,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#false} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {479#false} is VALID [2022-04-15 03:13:13,207 INFO L272 TraceCheckUtils]: 16: Hoare triple {479#false} [65] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_10 v_main_~z~0_8) (* (- 1) v_main_~x~0_10) v_main_~a~0_8 (* (- 1) (* v_main_~y~0_9 v_main_~az~0_7))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~az~0=v_main_~az~0_7, main_~y~0=v_main_~y~0_9, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_8, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {479#false} is VALID [2022-04-15 03:13:13,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#(< |main_#t~post7| 5)} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 5)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {479#false} is VALID [2022-04-15 03:13:13,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#(< ~counter~0 5)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {555#(< |main_#t~post7| 5)} is VALID [2022-04-15 03:13:13,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#(< ~counter~0 5)} [75] L35-1-->L34-3: Formula: (and (= (+ v_main_~a~0_5 (* v_main_~x~0_6 v_main_~z~0_5)) v_main_~x~0_5) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_5)) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {559#(< ~counter~0 5)} is VALID [2022-04-15 03:13:13,212 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {478#true} {559#(< ~counter~0 5)} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {559#(< ~counter~0 5)} is VALID [2022-04-15 03:13:13,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {478#true} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:13:13,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {478#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:13:13,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {478#true} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {478#true} is VALID [2022-04-15 03:13:13,228 INFO L272 TraceCheckUtils]: 8: Hoare triple {559#(< ~counter~0 5)} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {478#true} is VALID [2022-04-15 03:13:13,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {559#(< ~counter~0 5)} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 5) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {559#(< ~counter~0 5)} is VALID [2022-04-15 03:13:13,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#(< ~counter~0 4)} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {559#(< ~counter~0 5)} is VALID [2022-04-15 03:13:13,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {584#(< ~counter~0 4)} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {584#(< ~counter~0 4)} is VALID [2022-04-15 03:13:13,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {584#(< ~counter~0 4)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#(< ~counter~0 4)} is VALID [2022-04-15 03:13:13,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {584#(< ~counter~0 4)} {478#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#(< ~counter~0 4)} is VALID [2022-04-15 03:13:13,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#(< ~counter~0 4)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#(< ~counter~0 4)} is VALID [2022-04-15 03:13:13,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {584#(< ~counter~0 4)} is VALID [2022-04-15 03:13:13,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:13:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 03:13:13,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932909567] [2022-04-15 03:13:13,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675020431] [2022-04-15 03:13:13,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675020431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:13:13,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:13:13,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 03:13:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953298290] [2022-04-15 03:13:13,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:13:13,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-15 03:13:13,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:13,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:13:13,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:13,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 03:13:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 03:13:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 03:13:13,261 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:13:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:13,403 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-15 03:13:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 03:13:13,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-15 03:13:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:13:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 03:13:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:13:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 03:13:13,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-15 03:13:13,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:13,457 INFO L225 Difference]: With dead ends: 56 [2022-04-15 03:13:13,457 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 03:13:13,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 03:13:13,459 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:13:13,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 78 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:13:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 03:13:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-04-15 03:13:13,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:13,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:13:13,497 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:13:13,497 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:13:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:13,504 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-15 03:13:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-15 03:13:13,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:13,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:13,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states. [2022-04-15 03:13:13,505 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states. [2022-04-15 03:13:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:13,510 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-15 03:13:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-15 03:13:13,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:13,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:13,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:13,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:13:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-15 03:13:13,513 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2022-04-15 03:13:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:13,513 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-15 03:13:13,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:13:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 03:13:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 03:13:13,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:13,536 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:13,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 03:13:13,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:13,758 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash -831232834, now seen corresponding path program 1 times [2022-04-15 03:13:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:13,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637745512] [2022-04-15 03:13:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:13,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:13,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014841402] [2022-04-15 03:13:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:13,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:13,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:13,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:13:13,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 03:13:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:13,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 03:13:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:14,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:14,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {852#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#true} is VALID [2022-04-15 03:13:14,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {852#true} is VALID [2022-04-15 03:13:14,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {852#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#true} is VALID [2022-04-15 03:13:14,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#true} is VALID [2022-04-15 03:13:14,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {852#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#true} is VALID [2022-04-15 03:13:14,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {852#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:14,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:14,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 5) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:14,298 INFO L272 TraceCheckUtils]: 8: Hoare triple {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {852#true} is VALID [2022-04-15 03:13:14,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {852#true} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {885#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:13:14,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {885#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {889#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:13:14,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {889#(not (= |__VERIFIER_assert_#in~cond| 0))} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:13:14,299 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {889#(not (= |__VERIFIER_assert_#in~cond| 0))} {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:14,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [75] L35-1-->L34-3: Formula: (and (= (+ v_main_~a~0_5 (* v_main_~x~0_6 v_main_~z~0_5)) v_main_~x~0_5) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_5)) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:14,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:14,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 5) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:14,367 INFO L272 TraceCheckUtils]: 16: Hoare triple {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:13:14,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {909#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:13:14,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {853#false} is VALID [2022-04-15 03:13:14,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {853#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {853#false} is VALID [2022-04-15 03:13:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 03:13:14,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:13:22,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {853#false} [76] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {853#false} is VALID [2022-04-15 03:13:22,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {853#false} is VALID [2022-04-15 03:13:22,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {909#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:13:22,526 INFO L272 TraceCheckUtils]: 16: Hoare triple {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:13:22,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 5) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 03:13:22,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 03:13:22,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {939#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} [75] L35-1-->L34-3: Formula: (and (= (+ v_main_~a~0_5 (* v_main_~x~0_6 v_main_~z~0_5)) v_main_~x~0_5) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_5)) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_5, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 03:13:22,549 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {889#(not (= |__VERIFIER_assert_#in~cond| 0))} {852#true} [81] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {939#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-15 03:13:22,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {889#(not (= |__VERIFIER_assert_#in~cond| 0))} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:13:22,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {952#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {889#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:13:22,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {852#true} [69] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {952#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 03:13:22,553 INFO L272 TraceCheckUtils]: 8: Hoare triple {852#true} [70] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~x~0_9 v_main_~z~0_7) v_main_~a~0_7 (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6))) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {852#true} is VALID [2022-04-15 03:13:22,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {852#true} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 5) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {852#true} is VALID [2022-04-15 03:13:22,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {852#true} [64] L34-3-->L34-1: Formula: (and (= |v_main_#t~post7_5| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post7_5| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post7=|v_main_#t~post7_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {852#true} is VALID [2022-04-15 03:13:22,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {852#true} [61] mainENTRY-->L34-3: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= (* v_main_~a~0_2 v_main_~z~0_2) v_main_~az~0_2) (= v_main_~c~0_2 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~a~0_2 v_main_~x~0_2) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|) (= v_main_~y~0_2 1) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_2, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet5, main_#t~nondet4, main_#t~nondet6, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {852#true} is VALID [2022-04-15 03:13:22,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {852#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#true} is VALID [2022-04-15 03:13:22,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#true} is VALID [2022-04-15 03:13:22,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {852#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#true} is VALID [2022-04-15 03:13:22,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {852#true} is VALID [2022-04-15 03:13:22,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {852#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {852#true} is VALID [2022-04-15 03:13:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 03:13:22,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:22,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637745512] [2022-04-15 03:13:22,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:22,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014841402] [2022-04-15 03:13:22,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014841402] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:13:22,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:13:22,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-15 03:13:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433501158] [2022-04-15 03:13:22,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:13:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-15 03:13:22,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:22,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:13:22,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:22,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 03:13:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:22,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 03:13:22,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 03:13:22,654 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:13:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:23,752 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 03:13:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 03:13:23,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-15 03:13:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:13:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 03:13:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:13:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 03:13:23,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 03:13:25,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:25,661 INFO L225 Difference]: With dead ends: 45 [2022-04-15 03:13:25,661 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 03:13:25,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 03:13:25,662 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 03:13:25,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 102 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 03:13:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 03:13:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 03:13:25,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:25,663 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-15 03:13:25,663 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-15 03:13:25,663 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-15 03:13:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:25,663 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 03:13:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:13:25,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:25,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:25,663 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-15 03:13:25,663 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-15 03:13:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:25,663 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 03:13:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:13:25,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:25,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:25,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:25,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:25,664 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-15 03:13:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 03:13:25,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-15 03:13:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:25,664 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 03:13:25,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 03:13:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:13:25,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:25,666 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:13:25,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 03:13:25,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:25,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 03:13:26,119 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-15 03:13:26,119 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 03:13:26,119 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 03:13:26,119 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 03:13:26,120 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 03:13:26,120 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 22 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (<= ~counter~0 0)) [2022-04-15 03:13:26,120 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) [2022-04-15 03:13:26,120 INFO L878 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-15 03:13:26,120 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 46) no Hoare annotation was computed. [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 43) no Hoare annotation was computed. [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 46) no Hoare annotation was computed. [2022-04-15 03:13:26,120 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-15 03:13:26,120 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-15 03:13:26,121 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-15 03:13:26,121 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-15 03:13:26,121 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-15 03:13:26,123 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-15 03:13:26,124 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:13:26,126 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:13:26,131 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:13:26,131 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 03:13:26,132 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:13:26,133 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:13:26,133 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:13:26,133 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:13:26,133 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-15 03:13:26,133 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:13:26,133 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:13:26,133 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:13:26,133 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 03:13:26,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:13:26 BasicIcfg [2022-04-15 03:13:26,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:13:26,143 INFO L158 Benchmark]: Toolchain (without parser) took 16347.49ms. Allocated memory was 175.1MB in the beginning and 224.4MB in the end (delta: 49.3MB). Free memory was 148.4MB in the beginning and 91.0MB in the end (delta: 57.4MB). Peak memory consumption was 106.3MB. Max. memory is 8.0GB. [2022-04-15 03:13:26,143 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:13:26,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.83ms. Allocated memory was 175.1MB in the beginning and 224.4MB in the end (delta: 49.3MB). Free memory was 148.2MB in the beginning and 196.9MB in the end (delta: -48.7MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-04-15 03:13:26,144 INFO L158 Benchmark]: Boogie Preprocessor took 32.63ms. Allocated memory is still 224.4MB. Free memory was 196.9MB in the beginning and 195.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:13:26,144 INFO L158 Benchmark]: RCFGBuilder took 390.78ms. Allocated memory is still 224.4MB. Free memory was 195.5MB in the beginning and 183.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 03:13:26,144 INFO L158 Benchmark]: IcfgTransformer took 33.99ms. Allocated memory is still 224.4MB. Free memory was 183.9MB in the beginning and 182.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:13:26,145 INFO L158 Benchmark]: TraceAbstraction took 15599.02ms. Allocated memory is still 224.4MB. Free memory was 181.8MB in the beginning and 91.0MB in the end (delta: 90.8MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB. [2022-04-15 03:13:26,146 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.09ms. Allocated memory is still 175.1MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.83ms. Allocated memory was 175.1MB in the beginning and 224.4MB in the end (delta: 49.3MB). Free memory was 148.2MB in the beginning and 196.9MB in the end (delta: -48.7MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.63ms. Allocated memory is still 224.4MB. Free memory was 196.9MB in the beginning and 195.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 390.78ms. Allocated memory is still 224.4MB. Free memory was 195.5MB in the beginning and 183.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 33.99ms. Allocated memory is still 224.4MB. Free memory was 183.9MB in the beginning and 182.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 15599.02ms. Allocated memory is still 224.4MB. Free memory was 181.8MB in the beginning and 91.0MB in the end (delta: 90.8MB). Peak memory consumption was 92.1MB. 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: 17]: 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 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 93 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 19 PreInvPairs, 32 NumberOfFragments, 62 HoareAnnotationTreeSize, 19 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 147 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 372 SizeOfPredicates, 6 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 9/18 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 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: !(\old(counter) <= 0) || y * az + x == z * x + a RESULT: Ultimate proved your program to be correct! [2022-04-15 03:13:26,182 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...