/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/fermat2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:39:57,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:39:57,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:39:57,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:39:57,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:39:57,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:39:57,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:39:57,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:39:57,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:39:57,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:39:57,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:39:57,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:39:57,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:39:57,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:39:57,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:39:57,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:39:57,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:39:57,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:39:57,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:39:57,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:39:57,545 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:39:57,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:39:57,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:39:57,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:39:57,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:39:57,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:39:57,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:39:57,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:39:57,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:39:57,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:39:57,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:39:57,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:39:57,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:39:57,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:39:57,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:39:57,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:39:57,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:39:57,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:39:57,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:39:57,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:39:57,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:39:57,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:39:57,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:39:57,605 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:39:57,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:39:57,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:39:57,607 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:39:57,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:39:57,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:39:57,608 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:39:57,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:39:57,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:39:57,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:39:57,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:39:57,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:39:57,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:39:57,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:39:57,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:39:57,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:39:57,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:39:57,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:39:57,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:39:57,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:39:57,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:39:57,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:39:57,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:39:57,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:39:57,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:39:57,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:39:57,611 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:39:57,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:39:57,612 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:39:57,612 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 22:39:57,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:39:57,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:39:57,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:39:57,848 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:39:57,849 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:39:57,850 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/fermat2-ll.c [2022-04-27 22:39:57,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e29ad3a7/05b9644bfbe44ed9afeea7d38bbde9f0/FLAGb738a4fda [2022-04-27 22:39:58,258 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:39:58,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/fermat2-ll.c [2022-04-27 22:39:58,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e29ad3a7/05b9644bfbe44ed9afeea7d38bbde9f0/FLAGb738a4fda [2022-04-27 22:39:58,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e29ad3a7/05b9644bfbe44ed9afeea7d38bbde9f0 [2022-04-27 22:39:58,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:39:58,686 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:39:58,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:39:58,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:39:58,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:39:58,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:58,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2fde75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58, skipping insertion in model container [2022-04-27 22:39:58,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:58,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:39:58,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:39:58,900 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/fermat2-ll.c[524,537] [2022-04-27 22:39:58,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:39:58,937 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:39:58,953 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/fermat2-ll.c[524,537] [2022-04-27 22:39:58,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:39:58,987 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:39:58,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58 WrapperNode [2022-04-27 22:39:58,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:39:58,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:39:58,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:39:58,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:39:59,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:59,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:59,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:59,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:59,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:59,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:59,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:59,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:39:59,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:39:59,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:39:59,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:39:59,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (1/1) ... [2022-04-27 22:39:59,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:39:59,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:39:59,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:39:59,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:39:59,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:39:59,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:39:59,097 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:39:59,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:39:59,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:39:59,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:39:59,097 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:39:59,097 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:39:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:39:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:39:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:39:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:39:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:39:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:39:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:39:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:39:59,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:39:59,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:39:59,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:39:59,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:39:59,150 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:39:59,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:39:59,279 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:39:59,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:39:59,285 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:39:59,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:59 BoogieIcfgContainer [2022-04-27 22:39:59,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:39:59,287 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:39:59,287 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:39:59,288 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:39:59,291 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:59" (1/1) ... [2022-04-27 22:39:59,293 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:39:59,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:39:59 BasicIcfg [2022-04-27 22:39:59,326 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:39:59,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:39:59,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:39:59,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:39:59,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:39:58" (1/4) ... [2022-04-27 22:39:59,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f19ba26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:39:59, skipping insertion in model container [2022-04-27 22:39:59,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:58" (2/4) ... [2022-04-27 22:39:59,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f19ba26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:39:59, skipping insertion in model container [2022-04-27 22:39:59,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:59" (3/4) ... [2022-04-27 22:39:59,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f19ba26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:39:59, skipping insertion in model container [2022-04-27 22:39:59,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:39:59" (4/4) ... [2022-04-27 22:39:59,333 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll.cqvasr [2022-04-27 22:39:59,345 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:39:59,345 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:39:59,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:39:59,392 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ef533dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8f7ce82 [2022-04-27 22:39:59,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:39:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:39:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 22:39:59,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:39:59,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:39:59,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:39:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:39:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1058806997, now seen corresponding path program 1 times [2022-04-27 22:39:59,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:39:59,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057380203] [2022-04-27 22:39:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:39:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:39:59,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:39:59,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999143185] [2022-04-27 22:39:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:39:59,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:39:59,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:39:59,519 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-27 22:39:59,520 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-27 22:39:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:39:59,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 22:39:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:39:59,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:39:59,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 22:39:59,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) 13) (= (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{#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[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 22:39:59,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 22:39:59,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 22:39:59,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 22:39:59,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [73] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {32#true} is VALID [2022-04-27 22:39:59,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [75] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {32#true} is VALID [2022-04-27 22:39:59,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [77] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-27 22:39:59,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [80] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 22:39:59,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 22:39:59,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#true} {32#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {32#true} is VALID [2022-04-27 22:39:59,724 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#true} [76] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-27 22:39:59,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} [77] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-27 22:39:59,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} [80] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 22:39:59,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 22:39:59,727 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32#true} {32#true} [101] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-27 22:39:59,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#true} [78] L27-->L37-2: Formula: (and (= v_main_~v~0_3 1) (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~r~0_4 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {32#true} is VALID [2022-04-27 22:39:59,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {32#true} [81] L37-2-->L33-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 22:39:59,732 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} [85] L33-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {33#false} is VALID [2022-04-27 22:39:59,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} [88] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-27 22:39:59,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 22:39:59,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 22:39:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:39:59,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:39:59,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:39:59,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057380203] [2022-04-27 22:39:59,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:39:59,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999143185] [2022-04-27 22:39:59,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999143185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:39:59,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:39:59,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 22:39:59,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271699505] [2022-04-27 22:39:59,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:39:59,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 22:39:59,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:39:59,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:39:59,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:39:59,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 22:39:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:39:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 22:39:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 22:39:59,787 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:39:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:59,859 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 22:39:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 22:39:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 22:39:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:39:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:39:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-04-27 22:39:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:39:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-04-27 22:39:59,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-04-27 22:39:59,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:39:59,968 INFO L225 Difference]: With dead ends: 51 [2022-04-27 22:39:59,968 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 22:39:59,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-27 22:39:59,978 INFO L413 NwaCegarLoop]: 32 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, 32 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-27 22:39:59,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:39:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 22:40:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 22:40:00,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:40:00,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:40:00,011 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:40:00,012 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:40:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:00,015 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 22:40:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 22:40:00,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:00,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:40:00,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 22:40:00,018 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 22:40:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:00,023 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 22:40:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 22:40:00,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:00,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:40:00,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:40:00,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:40:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:40:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 22:40:00,031 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 22:40:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:40:00,032 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 22:40:00,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:40:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 22:40:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 22:40:00,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:40:00,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:40:00,051 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-27 22:40:00,239 WARN L477 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-27 22:40:00,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:40:00,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:40:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1056930164, now seen corresponding path program 1 times [2022-04-27 22:40:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:40:00,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622411319] [2022-04-27 22:40:00,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:40:00,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:40:00,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:40:00,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295219846] [2022-04-27 22:40:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:40:00,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:40:00,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:40:00,264 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-27 22:40:00,274 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-27 22:40:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:40:00,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 22:40:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:40:00,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:40:10,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {250#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#true} is VALID [2022-04-27 22:40:10,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {250#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) 13) (= (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{#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[#NULL.offset, #NULL.base] {250#true} is VALID [2022-04-27 22:40:10,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#true} is VALID [2022-04-27 22:40:10,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#true} {250#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#true} is VALID [2022-04-27 22:40:10,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#true} is VALID [2022-04-27 22:40:10,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#true} [73] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {250#true} is VALID [2022-04-27 22:40:10,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#true} [75] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {250#true} is VALID [2022-04-27 22:40:10,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#true} [77] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {250#true} is VALID [2022-04-27 22:40:10,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#true} [80] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {250#true} is VALID [2022-04-27 22:40:10,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#true} is VALID [2022-04-27 22:40:10,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#true} {250#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {250#true} is VALID [2022-04-27 22:40:10,072 INFO L272 TraceCheckUtils]: 11: Hoare triple {250#true} [76] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {250#true} is VALID [2022-04-27 22:40:10,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#true} [77] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {250#true} is VALID [2022-04-27 22:40:10,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {250#true} [80] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {250#true} is VALID [2022-04-27 22:40:10,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {250#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#true} is VALID [2022-04-27 22:40:10,073 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {250#true} {250#true} [101] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {250#true} is VALID [2022-04-27 22:40:12,074 WARN L290 TraceCheckUtils]: 16: Hoare triple {250#true} [78] L27-->L37-2: Formula: (and (= v_main_~v~0_3 1) (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~r~0_4 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {303#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-27 22:40:12,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {303#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [83] L37-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 22:40:14,091 WARN L272 TraceCheckUtils]: 18: Hoare triple {303#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [86] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {310#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 22:40:14,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#(<= 1 |__VERIFIER_assert_#in~cond|)} [88] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {314#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:40:14,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {314#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {251#false} is VALID [2022-04-27 22:40:14,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {251#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#false} is VALID [2022-04-27 22:40:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:40:14,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:40:14,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:40:14,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622411319] [2022-04-27 22:40:14,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:40:14,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295219846] [2022-04-27 22:40:14,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295219846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:40:14,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:40:14,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 22:40:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720527130] [2022-04-27 22:40:14,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:40:14,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 22:40:14,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:40:14,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:40:16,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:40:16,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:40:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:40:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:40:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:40:16,858 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:40:20,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 22:40:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:20,901 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 22:40:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:40:20,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 22:40:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:40:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:40:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 22:40:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:40:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 22:40:20,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 22:40:21,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:40:21,661 INFO L225 Difference]: With dead ends: 35 [2022-04-27 22:40:21,661 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 22:40:21,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:40:21,662 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-27 22:40:21,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-27 22:40:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 22:40:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-04-27 22:40:21,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:40:21,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:40:21,669 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:40:21,670 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:40:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:21,672 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 22:40:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-27 22:40:21,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:21,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:40:21,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-27 22:40:21,673 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-27 22:40:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:21,676 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 22:40:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-27 22:40:21,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:21,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:40:21,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:40:21,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:40:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:40:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-27 22:40:21,679 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2022-04-27 22:40:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:40:21,679 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-27 22:40:21,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:40:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-27 22:40:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 22:40:21,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:40:21,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:40:21,703 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-27 22:40:21,881 WARN L477 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-27 22:40:21,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:40:21,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:40:21,882 INFO L85 PathProgramCache]: Analyzing trace with hash -127181274, now seen corresponding path program 1 times [2022-04-27 22:40:21,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:40:21,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172161833] [2022-04-27 22:40:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:40:21,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:40:21,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:40:21,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370815160] [2022-04-27 22:40:21,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:40:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:40:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:40:21,903 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-27 22:40:21,904 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-27 22:40:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:40:21,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 22:40:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:40:21,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:40:22,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) 13) (= (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{#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[#NULL.offset, #NULL.base] {482#true} is VALID [2022-04-27 22:40:22,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} [73] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {482#true} is VALID [2022-04-27 22:40:22,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {482#true} [75] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {482#true} is VALID [2022-04-27 22:40:22,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {482#true} [77] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {482#true} is VALID [2022-04-27 22:40:22,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#true} [80] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {482#true} {482#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {482#true} is VALID [2022-04-27 22:40:22,195 INFO L272 TraceCheckUtils]: 11: Hoare triple {482#true} [76] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {482#true} is VALID [2022-04-27 22:40:22,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#true} [77] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {482#true} is VALID [2022-04-27 22:40:22,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#true} [80] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {482#true} {482#true} [101] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {482#true} is VALID [2022-04-27 22:40:22,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#true} [78] L27-->L37-2: Formula: (and (= v_main_~v~0_3 1) (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~r~0_4 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {482#true} is VALID [2022-04-27 22:40:22,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#true} [83] L37-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,201 INFO L272 TraceCheckUtils]: 18: Hoare triple {482#true} [86] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {482#true} is VALID [2022-04-27 22:40:22,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#true} [88] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {544#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:40:22,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {544#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [93] L12-->L12-2: Formula: (not (= 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[] {548#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:40:22,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {548#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:40:22,203 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {548#(not (= |__VERIFIER_assert_#in~cond| 0))} {482#true} [103] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {555#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-27 22:40:22,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {555#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} [89] L34-1-->L33-2: Formula: (= v_main_~r~0_6 0) InVars {main_~r~0=v_main_~r~0_6} OutVars{main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {559#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 22:40:22,205 INFO L272 TraceCheckUtils]: 24: Hoare triple {559#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} [85] L33-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:40:22,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} [88] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:40:22,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {483#false} is VALID [2022-04-27 22:40:22,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {483#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#false} is VALID [2022-04-27 22:40:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:40:22,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:40:22,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {483#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#false} is VALID [2022-04-27 22:40:22,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {483#false} is VALID [2022-04-27 22:40:22,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} [88] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:40:22,708 INFO L272 TraceCheckUtils]: 24: Hoare triple {559#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} [85] L33-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:40:22,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {586#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} [89] L34-1-->L33-2: Formula: (= v_main_~r~0_6 0) InVars {main_~r~0=v_main_~r~0_6} OutVars{main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {559#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 22:40:22,710 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {548#(not (= |__VERIFIER_assert_#in~cond| 0))} {482#true} [103] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {586#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-27 22:40:22,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {548#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:40:22,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {599#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [93] L12-->L12-2: Formula: (not (= 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[] {548#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:40:22,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#true} [88] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {599#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:40:22,712 INFO L272 TraceCheckUtils]: 18: Hoare triple {482#true} [86] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {482#true} is VALID [2022-04-27 22:40:22,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#true} [83] L37-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#true} [78] L27-->L37-2: Formula: (and (= v_main_~v~0_3 1) (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~r~0_4 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {482#true} is VALID [2022-04-27 22:40:22,713 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {482#true} {482#true} [101] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {482#true} is VALID [2022-04-27 22:40:22,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#true} [80] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#true} [77] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {482#true} is VALID [2022-04-27 22:40:22,714 INFO L272 TraceCheckUtils]: 11: Hoare triple {482#true} [76] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {482#true} is VALID [2022-04-27 22:40:22,714 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {482#true} {482#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {482#true} is VALID [2022-04-27 22:40:22,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#true} [80] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {482#true} [77] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {482#true} is VALID [2022-04-27 22:40:22,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {482#true} [75] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {482#true} is VALID [2022-04-27 22:40:22,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} [73] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {482#true} is VALID [2022-04-27 22:40:22,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) 13) (= (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{#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[#NULL.offset, #NULL.base] {482#true} is VALID [2022-04-27 22:40:22,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-27 22:40:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:40:22,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:40:22,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172161833] [2022-04-27 22:40:22,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:40:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370815160] [2022-04-27 22:40:22,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370815160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:40:22,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:40:22,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 22:40:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364327508] [2022-04-27 22:40:22,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 22:40:22,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2022-04-27 22:40:22,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:40:22,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 22:40:22,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:40:22,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 22:40:22,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:40:22,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 22:40:22,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 22:40:22,744 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 22:40:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:22,989 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 22:40:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:40:22,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2022-04-27 22:40:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:40:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 22:40:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 22:40:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 22:40:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 22:40:22,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-27 22:40:23,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:40:23,028 INFO L225 Difference]: With dead ends: 30 [2022-04-27 22:40:23,028 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:40:23,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:40:23,034 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:40:23,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:40:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:40:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:40:23,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:40:23,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:40:23,042 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:40:23,042 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:40:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:23,043 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:40:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:40:23,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:23,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:40:23,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:40:23,043 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:40:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:40:23,043 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:40:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:40:23,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:23,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:40:23,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:40:23,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:40:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:40:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:40:23,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-27 22:40:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:40:23,045 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:40:23,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 22:40:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:40:23,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:40:23,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:40:23,080 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-27 22:40:23,271 WARN L477 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-27 22:40:23,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:40:23,299 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:40:23,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:40:23,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:40:23,300 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:40:23,300 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:40:23,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:40:23,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:40:23,300 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 22:40:23,300 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 22:40:23,300 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 22:40:23,300 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 22:40:23,301 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 49) the Hoare annotation is: true [2022-04-27 22:40:23,301 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 22:40:23,301 INFO L902 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-04-27 22:40:23,301 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-27 22:40:23,301 INFO L895 garLoopResultBuilder]: At program point L37-2(lines 33 44) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-27 22:40:23,301 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 44) the Hoare annotation is: (let ((.cse0 (+ (* main_~v~0 2) (* main_~u~0 main_~u~0))) (.cse1 (* main_~v~0 main_~v~0)) (.cse2 (* main_~u~0 2)) (.cse3 (* main_~A~0 4))) (and (= .cse0 (+ .cse1 .cse2 .cse3 (* main_~r~0 4))) (= .cse0 (+ .cse1 .cse2 .cse3)))) [2022-04-27 22:40:23,301 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-27 22:40:23,301 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-04-27 22:40:23,301 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 33 44) no Hoare annotation was computed. [2022-04-27 22:40:23,301 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 49) no Hoare annotation was computed. [2022-04-27 22:40:23,301 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 43) no Hoare annotation was computed. [2022-04-27 22:40:23,301 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 49) no Hoare annotation was computed. [2022-04-27 22:40:23,302 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 22:40:23,302 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 22:40:23,302 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 22:40:23,302 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 22:40:23,302 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 22:40:23,302 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 22:40:23,305 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 22:40:23,306 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:40:23,312 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:40:23,312 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:40:23,312 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 22:40:23,312 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:40:23,312 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:40:23,312 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:40:23,312 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 22:40:23,313 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 22:40:23,315 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 22:40:23,315 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 22:40:23,315 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:40:23,315 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:40:23,315 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:40:23,315 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:40:23,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:40:23 BasicIcfg [2022-04-27 22:40:23,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:40:23,326 INFO L158 Benchmark]: Toolchain (without parser) took 24638.83ms. Allocated memory was 181.4MB in the beginning and 297.8MB in the end (delta: 116.4MB). Free memory was 121.1MB in the beginning and 153.2MB in the end (delta: -32.1MB). Peak memory consumption was 84.3MB. Max. memory is 8.0GB. [2022-04-27 22:40:23,326 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:40:23,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.39ms. Allocated memory was 181.4MB in the beginning and 297.8MB in the end (delta: 116.4MB). Free memory was 121.0MB in the beginning and 267.2MB in the end (delta: -146.2MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2022-04-27 22:40:23,326 INFO L158 Benchmark]: Boogie Preprocessor took 38.74ms. Allocated memory is still 297.8MB. Free memory was 267.2MB in the beginning and 265.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:40:23,327 INFO L158 Benchmark]: RCFGBuilder took 256.73ms. Allocated memory is still 297.8MB. Free memory was 265.6MB in the beginning and 254.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 22:40:23,327 INFO L158 Benchmark]: IcfgTransformer took 38.93ms. Allocated memory is still 297.8MB. Free memory was 254.0MB in the beginning and 252.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:40:23,327 INFO L158 Benchmark]: TraceAbstraction took 23996.40ms. Allocated memory is still 297.8MB. Free memory was 252.0MB in the beginning and 153.2MB in the end (delta: 98.8MB). Peak memory consumption was 99.3MB. Max. memory is 8.0GB. [2022-04-27 22:40:23,329 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.39ms. Allocated memory was 181.4MB in the beginning and 297.8MB in the end (delta: 116.4MB). Free memory was 121.0MB in the beginning and 267.2MB in the end (delta: -146.2MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.74ms. Allocated memory is still 297.8MB. Free memory was 267.2MB in the beginning and 265.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 256.73ms. Allocated memory is still 297.8MB. Free memory was 265.6MB in the beginning and 254.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 38.93ms. Allocated memory is still 297.8MB. Free memory was 254.0MB in the beginning and 252.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 23996.40ms. Allocated memory is still 297.8MB. Free memory was 252.0MB in the beginning and 153.2MB in the end (delta: 98.8MB). Peak memory consumption was 99.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 71 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 17 PreInvPairs, 23 NumberOfFragments, 90 HoareAnnotationTreeSize, 17 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 9 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 18/20 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: 33]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 RESULT: Ultimate proved your program to be correct! [2022-04-27 22:40:23,366 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...