/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_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:13:03,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:13:03,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:13:03,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:13:03,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:13:03,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:13:03,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:13:03,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:13:03,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:13:03,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:13:03,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:13:03,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:13:03,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:13:03,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:13:03,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:13:03,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:13:03,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:13:03,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:13:03,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:13:03,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:13:03,400 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:13:03,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:13:03,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:13:03,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:13:03,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:13:03,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:13:03,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:13:03,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:13:03,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:13:03,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:13:03,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:13:03,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:13:03,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:13:03,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:13:03,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:13:03,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:13:03,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:13:03,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:13:03,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:13:03,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:13:03,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:13:03,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:13:03,416 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:03,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:13:03,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:13:03,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:13:03,439 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:13:03,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:13:03,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:13:03,440 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:13:03,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:13:03,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:13:03,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:13:03,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:13:03,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:13:03,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:13:03,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:13:03,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:13:03,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:13:03,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:13:03,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:13:03,442 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:13:03,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:13:03,443 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:13:03,443 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:03,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:13:03,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:13:03,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:13:03,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:13:03,679 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:13:03,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound1.c [2022-04-15 03:13:03,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebdecdc3/d66aa80fe898436fac347e99f2d3e098/FLAGfc2e039fe [2022-04-15 03:13:04,131 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:13:04,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound1.c [2022-04-15 03:13:04,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebdecdc3/d66aa80fe898436fac347e99f2d3e098/FLAGfc2e039fe [2022-04-15 03:13:04,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebdecdc3/d66aa80fe898436fac347e99f2d3e098 [2022-04-15 03:13:04,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:13:04,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:13:04,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:13:04,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:13:04,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:13:04,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:13:04" (1/1) ... [2022-04-15 03:13:04,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411598b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:04, skipping insertion in model container [2022-04-15 03:13:04,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:13:04" (1/1) ... [2022-04-15 03:13:04,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:13:04,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:13:04,331 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_unwindbound1.c[525,538] [2022-04-15 03:13:04,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:13:04,369 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:13:04,393 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_unwindbound1.c[525,538] [2022-04-15 03:13:04,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:13:04,423 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:13:04,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:04 WrapperNode [2022-04-15 03:13:04,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:13:04,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:13:04,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:13:04,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:13:04,437 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:04" (1/1) ... [2022-04-15 03:13:04,437 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:04" (1/1) ... [2022-04-15 03:13:04,451 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:04" (1/1) ... [2022-04-15 03:13:04,452 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:04" (1/1) ... [2022-04-15 03:13:04,456 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:04" (1/1) ... [2022-04-15 03:13:04,461 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:04" (1/1) ... [2022-04-15 03:13:04,465 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:04" (1/1) ... [2022-04-15 03:13:04,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:13:04,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:13:04,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:13:04,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:13:04,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:04" (1/1) ... [2022-04-15 03:13:04,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:13:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:04,508 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:04,513 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:04,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:13:04,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:13:04,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:13:04,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:13:04,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:13:04,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:13:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:13:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:13:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:13:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:13:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:13:04,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:13:04,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:13:04,779 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:13:04,787 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:13:04,787 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 03:13:04,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:04 BoogieIcfgContainer [2022-04-15 03:13:04,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:13:04,789 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:13:04,789 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:13:04,791 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:13:04,793 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:04" (1/1) ... [2022-04-15 03:13:04,795 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:13:04,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:13:04 BasicIcfg [2022-04-15 03:13:04,820 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:13:04,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:13:04,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:13:04,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:13:04,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:13:04" (1/4) ... [2022-04-15 03:13:04,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4774d805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:13:04, skipping insertion in model container [2022-04-15 03:13:04,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:04" (2/4) ... [2022-04-15 03:13:04,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4774d805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:13:04, skipping insertion in model container [2022-04-15 03:13:04,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:04" (3/4) ... [2022-04-15 03:13:04,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4774d805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:13:04, skipping insertion in model container [2022-04-15 03:13:04,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:13:04" (4/4) ... [2022-04-15 03:13:04,831 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound1.cqvasr [2022-04-15 03:13:04,835 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:13:04,835 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:13:04,871 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:13:04,881 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:04,881 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:13:04,895 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:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 03:13:04,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:04,901 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:04,902 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:04,905 INFO L85 PathProgramCache]: Analyzing trace with hash -630084848, now seen corresponding path program 1 times [2022-04-15 03:13:04,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:04,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362506973] [2022-04-15 03:13:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:04,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:04,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:04,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885630882] [2022-04-15 03:13:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:04,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:04,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:04,989 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:04,990 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:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:05,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 03:13:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:05,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:05,318 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:05,319 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:05,319 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:05,319 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:05,319 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:05,320 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:05,322 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:05,322 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:05,323 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:05,323 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:05,323 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:05,324 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:05,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:13:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:05,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362506973] [2022-04-15 03:13:05,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:05,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885630882] [2022-04-15 03:13:05,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885630882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:13:05,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:13:05,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 03:13:05,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41760104] [2022-04-15 03:13:05,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:13:05,333 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:05,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:05,336 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:05,348 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:05,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 03:13:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 03:13:05,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 03:13:05,373 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:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:05,418 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 03:13:05,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 03:13:05,419 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:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:05,420 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:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-15 03:13:05,425 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:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-15 03:13:05,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-04-15 03:13:05,467 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:05,473 INFO L225 Difference]: With dead ends: 38 [2022-04-15 03:13:05,473 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 03:13:05,476 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:05,479 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:05,479 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:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 03:13:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 03:13:05,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:05,502 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:05,503 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:05,503 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:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:05,505 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 03:13:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 03:13:05,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:05,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:05,506 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:05,507 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:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:05,509 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 03:13:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 03:13:05,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:05,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:05,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:05,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:05,510 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:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 03:13:05,512 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 03:13:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:05,513 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 03:13:05,513 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:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 03:13:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 03:13:05,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:05,514 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:05,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 03:13:05,733 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:05,733 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:05,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:05,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1971636769, now seen corresponding path program 1 times [2022-04-15 03:13:05,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:05,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365898854] [2022-04-15 03:13:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:05,751 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:05,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796082356] [2022-04-15 03:13:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:05,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:05,757 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:05,778 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:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:05,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 03:13:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:05,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:05,910 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:05,911 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:05,912 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:05,912 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:05,914 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:05,915 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:05,916 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:05,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(<= |main_#t~post7| 0)} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 1)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {169#false} is VALID [2022-04-15 03:13:05,917 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:05,917 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:05,917 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:05,918 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:05,918 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:05,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:13:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:05,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365898854] [2022-04-15 03:13:05,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:05,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796082356] [2022-04-15 03:13:05,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796082356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:13:05,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:13:05,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 03:13:05,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113232220] [2022-04-15 03:13:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:13:05,920 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:05,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:05,921 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:05,931 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:05,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 03:13:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:05,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 03:13:05,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:13:05,933 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:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:05,971 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 03:13:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 03:13:05,971 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:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:05,971 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:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 03:13:05,973 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:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 03:13:05,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 03:13:06,000 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:06,002 INFO L225 Difference]: With dead ends: 26 [2022-04-15 03:13:06,002 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 03:13:06,002 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:06,005 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:06,006 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:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 03:13:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 03:13:06,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:06,014 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:06,015 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:06,016 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:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:06,018 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 03:13:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:13:06,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:06,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:06,019 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:06,019 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:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:06,022 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 03:13:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:13:06,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:06,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:06,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:06,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:06,024 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:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 03:13:06,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-15 03:13:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:06,025 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 03:13:06,025 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:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 03:13:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 03:13:06,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:06,026 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:06,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 03:13:06,231 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:06,232 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1972709245, now seen corresponding path program 1 times [2022-04-15 03:13:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:06,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047013615] [2022-04-15 03:13:06,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:06,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:06,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2101873606] [2022-04-15 03:13:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:06,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:06,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:06,277 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:06,281 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:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:06,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 03:13:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:06,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:06,517 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:06,517 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:06,517 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:06,518 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:06,518 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:06,519 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:06,520 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:06,520 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| 1) 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:06,521 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:06,522 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:06,522 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:06,522 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:06,523 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:06,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:13:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:06,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047013615] [2022-04-15 03:13:06,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:06,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101873606] [2022-04-15 03:13:06,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101873606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:13:06,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:13:06,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 03:13:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228323922] [2022-04-15 03:13:06,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:13:06,525 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:06,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:06,525 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:06,537 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:06,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:13:06,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:06,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:13:06,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:13:06,538 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:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:06,643 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 03:13:06,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:13:06,644 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:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:06,644 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:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 03:13:06,646 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:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 03:13:06,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 03:13:06,674 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:06,676 INFO L225 Difference]: With dead ends: 28 [2022-04-15 03:13:06,676 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 03:13:06,676 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:06,677 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:06,677 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:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 03:13:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 03:13:06,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:06,684 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:06,685 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:06,685 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:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:06,687 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 03:13:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 03:13:06,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:06,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:06,688 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:06,688 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:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:06,689 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 03:13:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 03:13:06,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:06,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:06,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:06,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:06,690 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:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 03:13:06,691 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-15 03:13:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:06,692 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 03:13:06,692 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:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 03:13:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 03:13:06,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:06,693 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:06,731 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:06,915 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:06,916 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:06,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash -832305310, now seen corresponding path program 1 times [2022-04-15 03:13:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:06,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113045053] [2022-04-15 03:13:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:06,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:06,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486765966] [2022-04-15 03:13:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:06,936 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:06,972 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:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:07,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 03:13:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:07,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:07,301 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:07,302 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] {478#true} is VALID [2022-04-15 03:13:07,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:13:07,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:13:07,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:13:07,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#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] {498#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 03:13:07,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {498#(and (= main_~y~0 1) (= main_~a~0 main_~x~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] {498#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 03:13:07,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {498#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 1) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {498#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 03:13:07,305 INFO L272 TraceCheckUtils]: 8: Hoare triple {498#(and (= main_~y~0 1) (= main_~a~0 main_~x~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] {478#true} is VALID [2022-04-15 03:13:07,305 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] {511#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:13:07,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {511#(= |__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[] {515#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:13:07,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(not (= |__VERIFIER_assert_#in~cond| 0))} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:13:07,307 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {515#(not (= |__VERIFIER_assert_#in~cond| 0))} {498#(and (= main_~y~0 1) (= main_~a~0 main_~x~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] {522#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (+ (* 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:07,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {522#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (+ (* main_~y~0 main_~az~0) main_~x~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] {526#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} is VALID [2022-04-15 03:13:07,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {526#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~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] {526#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} is VALID [2022-04-15 03:13:07,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {526#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 1)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {526#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} is VALID [2022-04-15 03:13:07,312 INFO L272 TraceCheckUtils]: 16: Hoare triple {526#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} [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] {536#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:13:07,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(<= 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] {540#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:13:07,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {540#(<= 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[] {479#false} is VALID [2022-04-15 03:13:07,313 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:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 03:13:07,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:13:29,691 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 03:14:12,925 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:14:12,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {540#(<= 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[] {479#false} is VALID [2022-04-15 03:14:12,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(<= 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] {540#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:14:12,927 INFO L272 TraceCheckUtils]: 16: Hoare triple {556#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [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] {536#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:14:12,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [66] L34-1-->L34-4: Formula: (not (< |v_main_#t~post7_2| 1)) InVars {main_#t~post7=|v_main_#t~post7_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {556#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 03:14:12,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#(= (+ (* 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] {556#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 03:14:12,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {566#(= (+ (* 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] {556#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 03:14:13,003 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {515#(not (= |__VERIFIER_assert_#in~cond| 0))} {478#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] {566#(= (+ (* 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:14:13,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(not (= |__VERIFIER_assert_#in~cond| 0))} [78] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:14:13,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {579#(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[] {515#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:14:13,004 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] {579#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 03:14:13,005 INFO L272 TraceCheckUtils]: 8: Hoare triple {478#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] {478#true} is VALID [2022-04-15 03:14:13,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {478#true} [67] L34-1-->L35: Formula: (< |v_main_#t~post7_4| 1) InVars {main_#t~post7=|v_main_#t~post7_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {478#true} is VALID [2022-04-15 03:14:13,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {478#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] {478#true} is VALID [2022-04-15 03:14:13,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#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] {478#true} is VALID [2022-04-15 03:14:13,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:14:13,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:14:13,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#true} is VALID [2022-04-15 03:14:13,006 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] {478#true} is VALID [2022-04-15 03:14:13,006 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:14:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 03:14:13,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:14:13,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113045053] [2022-04-15 03:14:13,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:14:13,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486765966] [2022-04-15 03:14:13,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486765966] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:14:13,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:14:13,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-15 03:14:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594344883] [2022-04-15 03:14:13,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:14:13,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) 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:14:13,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:14:13,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) 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:14:13,081 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:14:13,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 03:14:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:14:13,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 03:14:13,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 03:14:13,083 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) 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:14:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:14:13,963 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-15 03:14:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 03:14:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) 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:14:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:14:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) 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:14:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-15 03:14:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) 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:14:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-15 03:14:13,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-15 03:14:15,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:14:15,256 INFO L225 Difference]: With dead ends: 30 [2022-04-15 03:14:15,256 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 03:14:15,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-15 03:14:15,257 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 03:14:15,259 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 03:14:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 03:14:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 03:14:15,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:14:15,261 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:14:15,261 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:14:15,261 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:14:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:14:15,262 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 03:14:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:14:15,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:14:15,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:14:15,262 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:14:15,262 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:14:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:14:15,262 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 03:14:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:14:15,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:14:15,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:14:15,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:14:15,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:14:15,263 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:14:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 03:14:15,263 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-15 03:14:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:14:15,263 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 03:14:15,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) 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:14:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:14:15,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:14:15,266 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:14:15,283 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:14:15,474 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:14:15,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 03:14:15,679 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-15 03:14:15,679 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 03:14:15,679 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 03:14:15,679 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 03:14:15,679 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-15 03:14:15,680 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 03:14:15,680 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 03:14:15,680 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:14:15,680 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:14:15,680 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:14:15,680 INFO L882 garLoopResultBuilder]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2022-04-15 03:14:15,680 INFO L882 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-15 03:14:15,680 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:14:15,680 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 46) no Hoare annotation was computed. [2022-04-15 03:14:15,680 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 43) no Hoare annotation was computed. [2022-04-15 03:14:15,680 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 46) no Hoare annotation was computed. [2022-04-15 03:14:15,680 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 03:14:15,681 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-15 03:14:15,681 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-15 03:14:15,681 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-15 03:14:15,681 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-15 03:14:15,681 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-15 03:14:15,683 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-15 03:14:15,685 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:14:15,689 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:14:15,690 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:14:15,690 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 03:14:15,691 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 03:14:15,692 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:14:15,692 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:14:15,692 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:14:15,692 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:14:15,692 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-15 03:14:15,692 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:14:15,692 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:14:15,692 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:14:15,692 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:14:15,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:14:15 BasicIcfg [2022-04-15 03:14:15,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:14:15,704 INFO L158 Benchmark]: Toolchain (without parser) took 71547.15ms. Allocated memory was 172.0MB in the beginning and 250.6MB in the end (delta: 78.6MB). Free memory was 118.8MB in the beginning and 115.7MB in the end (delta: 3.1MB). Peak memory consumption was 82.4MB. Max. memory is 8.0GB. [2022-04-15 03:14:15,705 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 135.3MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:14:15,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.87ms. Allocated memory was 172.0MB in the beginning and 250.6MB in the end (delta: 78.6MB). Free memory was 118.7MB in the beginning and 226.6MB in the end (delta: -107.9MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-04-15 03:14:15,705 INFO L158 Benchmark]: Boogie Preprocessor took 40.73ms. Allocated memory is still 250.6MB. Free memory was 226.6MB in the beginning and 225.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 03:14:15,705 INFO L158 Benchmark]: RCFGBuilder took 320.07ms. Allocated memory is still 250.6MB. Free memory was 225.1MB in the beginning and 213.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 03:14:15,706 INFO L158 Benchmark]: IcfgTransformer took 30.87ms. Allocated memory is still 250.6MB. Free memory was 213.6MB in the beginning and 211.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 03:14:15,706 INFO L158 Benchmark]: TraceAbstraction took 70881.83ms. Allocated memory is still 250.6MB. Free memory was 211.5MB in the beginning and 115.7MB in the end (delta: 95.7MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. [2022-04-15 03:14:15,708 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.12ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 135.3MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.87ms. Allocated memory was 172.0MB in the beginning and 250.6MB in the end (delta: 78.6MB). Free memory was 118.7MB in the beginning and 226.6MB in the end (delta: -107.9MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.73ms. Allocated memory is still 250.6MB. Free memory was 226.6MB in the beginning and 225.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.07ms. Allocated memory is still 250.6MB. Free memory was 225.1MB in the beginning and 213.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 30.87ms. Allocated memory is still 250.6MB. Free memory was 213.6MB in the beginning and 211.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 70881.83ms. Allocated memory is still 250.6MB. Free memory was 211.5MB in the beginning and 115.7MB in the end (delta: 95.7MB). Peak memory consumption was 97.2MB. 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: 70.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 73 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 25 NumberOfFragments, 62 HoareAnnotationTreeSize, 16 FomulaSimplifications, 57 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 66.4s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 5 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 4/8 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:14:15,741 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...