/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 19:58:51,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 19:58:51,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 19:58:51,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 19:58:51,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 19:58:51,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 19:58:51,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 19:58:51,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 19:58:51,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 19:58:51,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 19:58:51,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 19:58:51,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 19:58:51,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 19:58:51,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 19:58:51,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 19:58:51,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 19:58:51,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 19:58:51,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 19:58:51,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 19:58:51,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 19:58:51,805 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 19:58:51,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 19:58:51,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 19:58:51,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 19:58:51,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 19:58:51,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 19:58:51,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 19:58:51,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 19:58:51,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 19:58:51,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 19:58:51,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 19:58:51,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 19:58:51,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 19:58:51,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 19:58:51,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 19:58:51,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 19:58:51,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 19:58:51,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 19:58:51,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 19:58:51,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 19:58:51,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 19:58:51,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 19:58:51,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 19:58:51,828 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 19:58:51,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 19:58:51,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 19:58:51,829 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 19:58:51,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 19:58:51,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 19:58:51,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 19:58:51,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 19:58:51,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 19:58:51,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 19:58:51,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 19:58:51,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 19:58:51,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 19:58:51,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 19:58:51,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 19:58:51,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 19:58:51,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 19:58:51,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 19:58:51,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:58:51,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 19:58:51,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 19:58:51,832 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 19:58:51,832 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 19:58:52,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 19:58:52,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 19:58:52,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 19:58:52,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 19:58:52,022 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 19:58:52,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c [2022-04-27 19:58:52,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4f63274/ac692324dc7740d28d80738aa79647f2/FLAGe88892be9 [2022-04-27 19:58:52,427 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 19:58:52,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c [2022-04-27 19:58:52,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4f63274/ac692324dc7740d28d80738aa79647f2/FLAGe88892be9 [2022-04-27 19:58:52,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4f63274/ac692324dc7740d28d80738aa79647f2 [2022-04-27 19:58:52,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 19:58:52,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 19:58:52,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 19:58:52,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 19:58:52,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 19:58:52,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e69cefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52, skipping insertion in model container [2022-04-27 19:58:52,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 19:58:52,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 19:58:52,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c[458,471] [2022-04-27 19:58:52,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:58:52,580 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 19:58:52,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c[458,471] [2022-04-27 19:58:52,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:58:52,604 INFO L208 MainTranslator]: Completed translation [2022-04-27 19:58:52,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52 WrapperNode [2022-04-27 19:58:52,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 19:58:52,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 19:58:52,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 19:58:52,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 19:58:52,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 19:58:52,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 19:58:52,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 19:58:52,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 19:58:52,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:58:52,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:52,666 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 19:58:52,687 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 19:58:52,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 19:58:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 19:58:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 19:58:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 19:58:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 19:58:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 19:58:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 19:58:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 19:58:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 19:58:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 19:58:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 19:58:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 19:58:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 19:58:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 19:58:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 19:58:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 19:58:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 19:58:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 19:58:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 19:58:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 19:58:52,743 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 19:58:52,744 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 19:58:52,853 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 19:58:52,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 19:58:52,857 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 19:58:52,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:58:52 BoogieIcfgContainer [2022-04-27 19:58:52,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 19:58:52,859 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 19:58:52,859 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 19:58:52,860 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 19:58:52,861 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:58:52" (1/1) ... [2022-04-27 19:58:52,863 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 19:58:52,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:58:52 BasicIcfg [2022-04-27 19:58:52,878 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 19:58:52,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 19:58:52,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 19:58:52,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 19:58:52,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 07:58:52" (1/4) ... [2022-04-27 19:58:52,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359fa2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:58:52, skipping insertion in model container [2022-04-27 19:58:52,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:58:52" (2/4) ... [2022-04-27 19:58:52,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359fa2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:58:52, skipping insertion in model container [2022-04-27 19:58:52,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:58:52" (3/4) ... [2022-04-27 19:58:52,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359fa2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:58:52, skipping insertion in model container [2022-04-27 19:58:52,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:58:52" (4/4) ... [2022-04-27 19:58:52,899 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound2.cJordan [2022-04-27 19:58:52,907 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 19:58:52,907 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 19:58:52,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 19:58:52,945 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@3104790, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@798a9281 [2022-04-27 19:58:52,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 19:58:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 19:58:52,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:52,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:52,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1984627219, now seen corresponding path program 1 times [2022-04-27 19:58:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:52,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382282159] [2022-04-27 19:58:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:53,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:58:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:53,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 19:58:53,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:58:53,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:58:53,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:58:53,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 19:58:53,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:58:53,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:58:53,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:58:53,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {26#true} is VALID [2022-04-27 19:58:53,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [66] L27-3-->L27-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 19:58:53,100 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {27#false} is VALID [2022-04-27 19:58:53,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-27 19:58:53,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 19:58:53,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 19:58:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:58:53,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:53,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382282159] [2022-04-27 19:58:53,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382282159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:58:53,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:58:53,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 19:58:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999088400] [2022-04-27 19:58:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:58:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 19:58:53,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:53,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:53,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 19:58:53,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:53,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 19:58:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 19:58:53,141 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:53,229 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 19:58:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 19:58:53,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 19:58:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-27 19:58:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-27 19:58:53,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2022-04-27 19:58:53,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:53,277 INFO L225 Difference]: With dead ends: 24 [2022-04-27 19:58:53,278 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 19:58:53,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 19:58:53,284 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:53,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:58:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 19:58:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 19:58:53,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:53,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:53,310 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:53,311 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:53,321 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 19:58:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 19:58:53,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:53,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:53,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 19:58:53,323 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 19:58:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:53,326 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 19:58:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 19:58:53,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:53,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:53,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:53,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 19:58:53,330 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-27 19:58:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:53,330 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 19:58:53,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 19:58:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 19:58:53,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:53,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:53,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 19:58:53,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1423332195, now seen corresponding path program 1 times [2022-04-27 19:58:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:53,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738495562] [2022-04-27 19:58:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:53,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:53,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461480997] [2022-04-27 19:58:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:53,368 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 19:58:53,368 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 19:58:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:53,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 19:58:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:53,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:53,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {114#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#true} is VALID [2022-04-27 19:58:53,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:53,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {122#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:53,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122#(<= ~counter~0 0)} {114#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:53,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {122#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:53,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {122#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:53,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {122#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {138#(<= |main_#t~post5| 0)} is VALID [2022-04-27 19:58:53,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#(<= |main_#t~post5| 0)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {115#false} is VALID [2022-04-27 19:58:53,535 INFO L272 TraceCheckUtils]: 8: Hoare triple {115#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {115#false} is VALID [2022-04-27 19:58:53,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {115#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {115#false} is VALID [2022-04-27 19:58:53,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {115#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {115#false} is VALID [2022-04-27 19:58:53,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {115#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#false} is VALID [2022-04-27 19:58:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:58:53,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:58:53,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:53,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738495562] [2022-04-27 19:58:53,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:53,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461480997] [2022-04-27 19:58:53,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461480997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:58:53,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:58:53,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 19:58:53,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530334117] [2022-04-27 19:58:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:58:53,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 19:58:53,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:53,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:53,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 19:58:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:53,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 19:58:53,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 19:58:53,556 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:53,615 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 19:58:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 19:58:53,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 19:58:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-27 19:58:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-27 19:58:53,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-04-27 19:58:53,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:53,637 INFO L225 Difference]: With dead ends: 20 [2022-04-27 19:58:53,637 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 19:58:53,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 19:58:53,638 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:53,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:58:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 19:58:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 19:58:53,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:53,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:53,643 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:53,644 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:53,646 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 19:58:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 19:58:53,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:53,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:53,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 19:58:53,649 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 19:58:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:53,652 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 19:58:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 19:58:53,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:53,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:53,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:53,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 19:58:53,660 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 19:58:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:53,660 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 19:58:53,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 19:58:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 19:58:53,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:53,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:53,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 19:58:53,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:53,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404671, now seen corresponding path program 1 times [2022-04-27 19:58:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:53,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371629341] [2022-04-27 19:58:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:53,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:53,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775229134] [2022-04-27 19:58:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:53,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:53,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:53,884 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 19:58:53,887 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 19:58:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:53,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 19:58:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:53,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:54,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {233#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-27 19:58:54,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {233#true} is VALID [2022-04-27 19:58:54,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {233#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-27 19:58:54,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-27 19:58:54,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {233#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-27 19:58:54,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {233#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {253#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:54,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {253#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {253#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:54,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {253#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:54,012 INFO L272 TraceCheckUtils]: 8: Hoare triple {253#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {263#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:54,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {267#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:54,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {234#false} is VALID [2022-04-27 19:58:54,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#false} is VALID [2022-04-27 19:58:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:58:54,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:58:54,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371629341] [2022-04-27 19:58:54,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775229134] [2022-04-27 19:58:54,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775229134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:58:54,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:58:54,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 19:58:54,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663654223] [2022-04-27 19:58:54,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:58:54,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 19:58:54,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:54,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:54,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:58:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:54,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:58:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:58:54,029 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:54,180 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 19:58:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:58:54,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 19:58:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-27 19:58:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-27 19:58:54,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-04-27 19:58:54,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:54,212 INFO L225 Difference]: With dead ends: 28 [2022-04-27 19:58:54,212 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 19:58:54,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:58:54,214 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:54,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:58:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 19:58:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 19:58:54,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:54,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 19:58:54,221 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 19:58:54,221 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 19:58:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:54,225 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 19:58:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 19:58:54,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:54,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:54,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 26 states. [2022-04-27 19:58:54,226 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 26 states. [2022-04-27 19:58:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:54,232 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 19:58:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 19:58:54,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:54,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:54,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:54,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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 19:58:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 19:58:54,237 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-27 19:58:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:54,237 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 19:58:54,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 19:58:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 19:58:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 19:58:54,240 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:54,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:54,257 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 19:58:54,457 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,SelfDestructingSolverStorable2 [2022-04-27 19:58:54,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash -381498108, now seen corresponding path program 1 times [2022-04-27 19:58:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:54,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607302433] [2022-04-27 19:58:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:54,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:54,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305976826] [2022-04-27 19:58:54,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:54,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:54,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:54,477 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 19:58:54,478 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 19:58:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:54,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 19:58:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:54,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:54,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {381#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 19:58:54,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {389#(<= ~counter~0 0)} {381#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {389#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {389#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,650 INFO L272 TraceCheckUtils]: 8: Hoare triple {405#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {405#(<= ~counter~0 1)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(<= ~counter~0 1)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {405#(<= ~counter~0 1)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,654 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {405#(<= ~counter~0 1)} {405#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {405#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {430#(<= |main_#t~post5| 1)} is VALID [2022-04-27 19:58:54,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#(<= |main_#t~post5| 1)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {382#false} is VALID [2022-04-27 19:58:54,656 INFO L272 TraceCheckUtils]: 16: Hoare triple {382#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {382#false} is VALID [2022-04-27 19:58:54,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {382#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {382#false} is VALID [2022-04-27 19:58:54,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {382#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 19:58:54,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {382#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 19:58:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:58:54,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:54,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {382#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 19:58:54,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {382#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 19:58:54,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {382#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {382#false} is VALID [2022-04-27 19:58:54,768 INFO L272 TraceCheckUtils]: 16: Hoare triple {382#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {382#false} is VALID [2022-04-27 19:58:54,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#(<= |main_#t~post5| 1)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {382#false} is VALID [2022-04-27 19:58:54,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {430#(<= |main_#t~post5| 1)} is VALID [2022-04-27 19:58:54,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {405#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,770 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {381#true} {405#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {381#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 19:58:54,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 19:58:54,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {381#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {381#true} is VALID [2022-04-27 19:58:54,771 INFO L272 TraceCheckUtils]: 8: Hoare triple {405#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {381#true} is VALID [2022-04-27 19:58:54,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {389#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:54,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {389#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {389#(<= ~counter~0 0)} {381#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:54,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {381#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 19:58:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:58:54,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607302433] [2022-04-27 19:58:54,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305976826] [2022-04-27 19:58:54,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305976826] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 19:58:54,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 19:58:54,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 19:58:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436516081] [2022-04-27 19:58:54,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:54,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-27 19:58:54,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:54,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:58:54,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:54,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:58:54,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:58:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:58:54,791 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:58:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:54,855 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 19:58:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 19:58:54,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-27 19:58:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:58:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 19:58:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:58:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 19:58:54,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-27 19:58:54,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:54,882 INFO L225 Difference]: With dead ends: 28 [2022-04-27 19:58:54,882 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 19:58:54,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:58:54,884 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:54,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:58:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 19:58:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 19:58:54,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:54,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 19:58:54,891 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 19:58:54,891 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 19:58:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:54,894 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 19:58:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 19:58:54,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:54,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:54,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 28 states. [2022-04-27 19:58:54,895 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 28 states. [2022-04-27 19:58:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:54,900 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 19:58:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 19:58:54,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:54,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:54,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:54,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 19:58:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-27 19:58:54,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-27 19:58:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:54,903 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-27 19:58:54,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 19:58:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 19:58:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 19:58:54,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:54,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:54,920 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 19:58:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:55,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -380425632, now seen corresponding path program 1 times [2022-04-27 19:58:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:55,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803610443] [2022-04-27 19:58:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:55,130 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:55,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839509070] [2022-04-27 19:58:55,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:55,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:55,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:55,131 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:55,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 19:58:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:55,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 19:58:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:55,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:55,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {619#true} is VALID [2022-04-27 19:58:55,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {639#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:55,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {639#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {639#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:55,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {639#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {639#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:55,284 INFO L272 TraceCheckUtils]: 8: Hoare triple {639#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {619#true} is VALID [2022-04-27 19:58:55,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {619#true} is VALID [2022-04-27 19:58:55,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {619#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {619#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,284 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {619#true} {639#(and (= main_~x~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {639#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:55,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {639#(and (= main_~x~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {664#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 19:58:55,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {664#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 19:58:55,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {664#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 19:58:55,286 INFO L272 TraceCheckUtils]: 16: Hoare triple {664#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:55,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {674#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:55,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {678#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-27 19:58:55,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {620#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-27 19:58:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:58:55,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:55,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {620#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-27 19:58:55,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {678#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-27 19:58:55,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {674#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:55,398 INFO L272 TraceCheckUtils]: 16: Hoare triple {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:55,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:58:55,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:58:55,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:58:55,655 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {619#true} {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:58:55,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {619#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {619#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {619#true} is VALID [2022-04-27 19:58:55,656 INFO L272 TraceCheckUtils]: 8: Hoare triple {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {619#true} is VALID [2022-04-27 19:58:55,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:58:55,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:58:55,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {694#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:58:55,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {619#true} is VALID [2022-04-27 19:58:55,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 19:58:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 19:58:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:55,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803610443] [2022-04-27 19:58:55,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:55,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839509070] [2022-04-27 19:58:55,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839509070] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:55,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:55,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 19:58:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094190519] [2022-04-27 19:58:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:58:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 19:58:55,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:55,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:58:56,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:56,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:58:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:58:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 19:58:56,131 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:58:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:56,209 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 19:58:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:58:56,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 19:58:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:58:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 19:58:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:58:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 19:58:56,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-27 19:58:56,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:56,672 INFO L225 Difference]: With dead ends: 32 [2022-04-27 19:58:56,672 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 19:58:56,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 19:58:56,672 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:56,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:58:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 19:58:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 19:58:56,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:56,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:56,675 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:56,675 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:56,676 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 19:58:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 19:58:56,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:56,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:56,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 19:58:56,676 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 19:58:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:56,677 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 19:58:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 19:58:56,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:56,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:56,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:56,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-27 19:58:56,678 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-27 19:58:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:56,678 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-27 19:58:56,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:58:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 19:58:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 19:58:56,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:56,679 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:56,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 19:58:56,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:56,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1647871298, now seen corresponding path program 1 times [2022-04-27 19:58:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:56,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999270844] [2022-04-27 19:58:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:56,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:56,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481085790] [2022-04-27 19:58:56,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:56,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:56,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:56,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:56,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 19:58:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:56,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 19:58:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:56,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:57,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {866#true} is VALID [2022-04-27 19:58:57,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {866#true} is VALID [2022-04-27 19:58:57,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {866#true} is VALID [2022-04-27 19:58:57,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {866#true} is VALID [2022-04-27 19:58:57,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {866#true} is VALID [2022-04-27 19:58:57,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:57,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:57,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:57,288 INFO L272 TraceCheckUtils]: 8: Hoare triple {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {866#true} is VALID [2022-04-27 19:58:57,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {866#true} is VALID [2022-04-27 19:58:57,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {866#true} is VALID [2022-04-27 19:58:57,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {866#true} is VALID [2022-04-27 19:58:57,288 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {866#true} {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:57,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {886#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {911#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 19:58:57,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {911#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {911#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 19:58:57,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {911#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {911#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 19:58:57,290 INFO L272 TraceCheckUtils]: 16: Hoare triple {911#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {866#true} is VALID [2022-04-27 19:58:57,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {924#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:57,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {924#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {928#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:58:57,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {928#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {928#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:58:57,292 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {928#(not (= |__VERIFIER_assert_#in~cond| 0))} {911#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {935#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 19:58:57,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {935#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {939#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:57,293 INFO L272 TraceCheckUtils]: 22: Hoare triple {939#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {943#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:57,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {943#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {947#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:57,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {947#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {867#false} is VALID [2022-04-27 19:58:57,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {867#false} is VALID [2022-04-27 19:58:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 19:58:57,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:59:15,739 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 13) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ .cse1 .cse2 .cse3) 4) 0)) (not (<= (div (+ .cse1 .cse2 .cse3 (- 4)) (- 4)) (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))))))) is different from false [2022-04-27 19:59:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:59:17,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999270844] [2022-04-27 19:59:17,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:59:17,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481085790] [2022-04-27 19:59:17,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481085790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:59:17,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:59:17,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 19:59:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941251851] [2022-04-27 19:59:17,831 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:59:17,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 19:59:17,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:59:17,832 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), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:59:17,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:59:17,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 19:59:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:59:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 19:59:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=140, Unknown=1, NotChecked=24, Total=210 [2022-04-27 19:59:17,854 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:59:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:59:18,091 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 19:59:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 19:59:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 19:59:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:59:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:59:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-27 19:59:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:59:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-27 19:59:18,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-04-27 19:59:18,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:59:18,118 INFO L225 Difference]: With dead ends: 34 [2022-04-27 19:59:18,118 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 19:59:18,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=66, Invalid=209, Unknown=1, NotChecked=30, Total=306 [2022-04-27 19:59:18,119 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:59:18,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:59:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 19:59:18,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 19:59:18,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:59:18,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 19:59:18,121 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 19:59:18,121 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 19:59:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:59:18,122 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-27 19:59:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 19:59:18,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:59:18,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:59:18,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 31 states. [2022-04-27 19:59:18,123 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 31 states. [2022-04-27 19:59:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:59:18,124 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-27 19:59:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 19:59:18,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:59:18,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:59:18,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:59:18,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:59:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 19:59:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-27 19:59:18,125 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-27 19:59:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:59:18,126 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-27 19:59:18,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:59:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 19:59:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 19:59:18,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:59:18,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:59:18,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 19:59:18,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:59:18,339 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:59:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:59:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash -382724699, now seen corresponding path program 2 times [2022-04-27 19:59:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:59:18,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592366644] [2022-04-27 19:59:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:59:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:59:18,363 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:59:18,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86896708] [2022-04-27 19:59:18,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 19:59:18,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:59:18,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:59:18,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:59:18,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 19:59:18,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 19:59:18,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 19:59:18,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 19:59:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 19:59:18,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 19:59:18,423 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 19:59:18,424 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 19:59:18,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 19:59:18,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:59:18,642 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-04-27 19:59:18,645 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 19:59:18,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:59:18 BasicIcfg [2022-04-27 19:59:18,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 19:59:18,666 INFO L158 Benchmark]: Toolchain (without parser) took 26225.69ms. Allocated memory was 210.8MB in the beginning and 259.0MB in the end (delta: 48.2MB). Free memory was 161.2MB in the beginning and 106.7MB in the end (delta: 54.4MB). Peak memory consumption was 103.5MB. Max. memory is 8.0GB. [2022-04-27 19:59:18,666 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 19:59:18,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.81ms. Allocated memory is still 210.8MB. Free memory was 161.0MB in the beginning and 185.5MB in the end (delta: -24.4MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-27 19:59:18,666 INFO L158 Benchmark]: Boogie Preprocessor took 28.49ms. Allocated memory is still 210.8MB. Free memory was 185.5MB in the beginning and 184.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 19:59:18,667 INFO L158 Benchmark]: RCFGBuilder took 224.60ms. Allocated memory is still 210.8MB. Free memory was 184.1MB in the beginning and 173.2MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 19:59:18,667 INFO L158 Benchmark]: IcfgTransformer took 19.17ms. Allocated memory is still 210.8MB. Free memory was 173.2MB in the beginning and 171.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 19:59:18,667 INFO L158 Benchmark]: TraceAbstraction took 25786.15ms. Allocated memory was 210.8MB in the beginning and 259.0MB in the end (delta: 48.2MB). Free memory was 171.2MB in the beginning and 106.7MB in the end (delta: 64.4MB). Peak memory consumption was 112.5MB. Max. memory is 8.0GB. [2022-04-27 19:59:18,668 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 162.81ms. Allocated memory is still 210.8MB. Free memory was 161.0MB in the beginning and 185.5MB in the end (delta: -24.4MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.49ms. Allocated memory is still 210.8MB. Free memory was 185.5MB in the beginning and 184.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 224.60ms. Allocated memory is still 210.8MB. Free memory was 184.1MB in the beginning and 173.2MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.17ms. Allocated memory is still 210.8MB. Free memory was 173.2MB in the beginning and 171.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 25786.15ms. Allocated memory was 210.8MB in the beginning and 259.0MB in the end (delta: 48.2MB). Free memory was 171.2MB in the beginning and 106.7MB in the end (delta: 64.4MB). Peak memory consumption was 112.5MB. 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 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; VAL [\old(counter)=10, counter=0] [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [\old(counter)=0, c=0, counter=0, k=3, x=0, y=0] [L27] EXPR counter++ VAL [\old(counter)=0, c=0, counter=1, counter++=0, k=3, x=0, y=0] [L27] COND TRUE counter++<2 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=0, counter=1, k=3, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=1, counter=1, k=3, x=1, y=1] [L27] EXPR counter++ VAL [\old(counter)=0, c=1, counter=2, counter++=1, k=3, x=1, y=1] [L27] COND TRUE counter++<2 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=1, counter=2, k=3, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=2, counter=2, k=3, x=9, y=2] [L27] EXPR counter++ VAL [\old(counter)=0, c=2, counter=3, counter++=2, k=3, x=9, y=2] [L27] COND FALSE !(counter++<2) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L10] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L12] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 117 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=6, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 541 SizeOfPredicates, 9 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 18/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 19:59:18,682 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...