/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/cohencu-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:34:33,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:34:33,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:34:33,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:34:33,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:34:33,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:34:33,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:34:33,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:34:33,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:34:33,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:34:33,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:34:33,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:34:33,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:34:33,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:34:33,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:34:33,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:34:33,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:34:33,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:34:33,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:34:33,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:34:33,657 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:34:33,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:34:33,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:34:33,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:34:33,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:34:33,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:34:33,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:34:33,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:34:33,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:34:33,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:34:33,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:34:33,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:34:33,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:34:33,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:34:33,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:34:33,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:34:33,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:34:33,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:34:33,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:34:33,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:34:33,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:34:33,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:34:33,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:34:33,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:34:33,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:34:33,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:34:33,696 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:34:33,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:34:33,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:34:33,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:34:33,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:34:33,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:34:33,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:34:33,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:34:33,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:34:33,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:34:33,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:34:33,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:34:33,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:34:33,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:34:33,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:34:33,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:34:33,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:34:33,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:34:33,700 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:34:33,700 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 17:34:33,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:34:33,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:34:33,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:34:33,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:34:33,992 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:34:33,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-04-27 17:34:34,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b630b49/24d2f96c11a64e1ea5d4c3af237fd4cb/FLAG37a2b4037 [2022-04-27 17:34:34,479 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:34:34,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-04-27 17:34:34,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b630b49/24d2f96c11a64e1ea5d4c3af237fd4cb/FLAG37a2b4037 [2022-04-27 17:34:34,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b630b49/24d2f96c11a64e1ea5d4c3af237fd4cb [2022-04-27 17:34:34,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:34:34,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:34:34,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:34:34,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:34:34,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:34:34,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b456db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34, skipping insertion in model container [2022-04-27 17:34:34,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:34:34,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:34:34,724 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/cohencu-ll_unwindbound1.c[588,601] [2022-04-27 17:34:34,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:34:34,776 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:34:34,791 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/cohencu-ll_unwindbound1.c[588,601] [2022-04-27 17:34:34,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:34:34,824 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:34:34,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34 WrapperNode [2022-04-27 17:34:34,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:34:34,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:34:34,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:34:34,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:34:34,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:34:34,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:34:34,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:34:34,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:34:34,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (1/1) ... [2022-04-27 17:34:34,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:34:34,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:34:34,896 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 17:34:34,923 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 17:34:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:34:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:34:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:34:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:34:34,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:34:34,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:34:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:34:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:34:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:34:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:34:34,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-27 17:34:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:34:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:34:34,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:34:34,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:34:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:34:34,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:34:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:34:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:34:34,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:34:35,004 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:34:35,005 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:34:35,193 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:34:35,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:34:35,210 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 17:34:35,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:34:35 BoogieIcfgContainer [2022-04-27 17:34:35,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:34:35,213 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:34:35,213 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:34:35,214 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:34:35,216 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:34:35" (1/1) ... [2022-04-27 17:34:35,218 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:34:35,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:34:35 BasicIcfg [2022-04-27 17:34:35,260 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:34:35,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:34:35,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:34:35,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:34:35,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:34:34" (1/4) ... [2022-04-27 17:34:35,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2cbbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:34:35, skipping insertion in model container [2022-04-27 17:34:35,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:34:34" (2/4) ... [2022-04-27 17:34:35,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2cbbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:34:35, skipping insertion in model container [2022-04-27 17:34:35,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:34:35" (3/4) ... [2022-04-27 17:34:35,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2cbbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:34:35, skipping insertion in model container [2022-04-27 17:34:35,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:34:35" (4/4) ... [2022-04-27 17:34:35,266 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.cJordan [2022-04-27 17:34:35,279 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:34:35,280 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:34:35,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:34:35,336 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@164c6b96, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1165aed0 [2022-04-27 17:34:35,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:34:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 17:34:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 17:34:35,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:34:35,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:34:35,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:34:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:34:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-04-27 17:34:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:34:35,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619885427] [2022-04-27 17:34:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:35,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:34:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:34:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:35,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {34#true} is VALID [2022-04-27 17:34:35,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:34:35,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:34:35,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:34:35,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {34#true} is VALID [2022-04-27 17:34:35,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:34:35,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:34:35,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:34:35,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {34#true} is VALID [2022-04-27 17:34:35,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [90] L33-3-->L33-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:34:35,554 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {35#false} is VALID [2022-04-27 17:34:35,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-27 17:34:35,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:34:35,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:34:35,555 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 17:34:35,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:34:35,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619885427] [2022-04-27 17:34:35,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619885427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:34:35,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:34:35,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:34:35,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343804996] [2022-04-27 17:34:35,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:34:35,564 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 17:34:35,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:34:35,568 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 17:34:35,593 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 17:34:35,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:34:35,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:34:35,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:34:35,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:34:35,619 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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 17:34:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:35,865 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-27 17:34:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:34:35,866 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 17:34:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:34:35,867 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 17:34:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 17:34:35,877 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 17:34:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 17:34:35,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-27 17:34:35,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:35,971 INFO L225 Difference]: With dead ends: 32 [2022-04-27 17:34:35,972 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 17:34:35,973 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 17:34:35,979 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:34:35,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:34:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 17:34:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 17:34:36,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:34:36,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:36,013 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:36,013 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:36,021 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-27 17:34:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-27 17:34:36,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:36,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:36,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-27 17:34:36,025 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-27 17:34:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:36,032 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-27 17:34:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-27 17:34:36,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:36,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:36,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:34:36,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:34:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-27 17:34:36,040 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-27 17:34:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:34:36,040 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-27 17:34:36,040 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 17:34:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-27 17:34:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 17:34:36,042 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:34:36,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:34:36,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:34:36,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:34:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:34:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-04-27 17:34:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:34:36,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768985610] [2022-04-27 17:34:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:34:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:34:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:36,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {159#(= ~counter~0 0)} is VALID [2022-04-27 17:34:36,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-27 17:34:36,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#(= ~counter~0 0)} {154#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-27 17:34:36,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:34:36,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {159#(= ~counter~0 0)} is VALID [2022-04-27 17:34:36,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-27 17:34:36,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#(= ~counter~0 0)} {154#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-27 17:34:36,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#(= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-27 17:34:36,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#(= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {159#(= ~counter~0 0)} is VALID [2022-04-27 17:34:36,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {160#(= |main_#t~post5| 0)} is VALID [2022-04-27 17:34:36,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#(= |main_#t~post5| 0)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 1)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {155#false} is VALID [2022-04-27 17:34:36,202 INFO L272 TraceCheckUtils]: 8: Hoare triple {155#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {155#false} is VALID [2022-04-27 17:34:36,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {155#false} is VALID [2022-04-27 17:34:36,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-27 17:34:36,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-27 17:34:36,204 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 17:34:36,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:34:36,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768985610] [2022-04-27 17:34:36,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768985610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:34:36,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:34:36,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 17:34:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107362727] [2022-04-27 17:34:36,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:34:36,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 17:34:36,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:34:36,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 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 17:34:36,218 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 17:34:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:34:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:34:36,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:34:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:34:36,224 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 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 17:34:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:36,480 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 17:34:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 17:34:36,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 17:34:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:34:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 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 17:34:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 17:34:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 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 17:34:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 17:34:36,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-27 17:34:36,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:36,531 INFO L225 Difference]: With dead ends: 28 [2022-04-27 17:34:36,531 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 17:34:36,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 17:34:36,534 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:34:36,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:34:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 17:34:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 17:34:36,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:34:36,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:36,543 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:36,543 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:36,550 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 17:34:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 17:34:36,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:36,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:36,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-27 17:34:36,558 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-27 17:34:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:36,561 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 17:34:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 17:34:36,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:36,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:36,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:34:36,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:34:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-27 17:34:36,568 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-27 17:34:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:34:36,568 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-27 17:34:36,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 17:34:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 17:34:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 17:34:36,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:34:36,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:34:36,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:34:36,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:34:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:34:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-04-27 17:34:36,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:34:36,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198446196] [2022-04-27 17:34:36,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:34:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:36,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:34:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:36,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {278#true} is VALID [2022-04-27 17:34:36,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 17:34:36,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 17:34:36,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:34:36,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {278#true} is VALID [2022-04-27 17:34:36,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 17:34:36,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 17:34:36,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 17:34:36,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 17:34:36,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 17:34:36,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 17:34:36,694 INFO L272 TraceCheckUtils]: 8: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {284#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:34:36,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {285#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:34:36,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#(not (= __VERIFIER_assert_~cond 0))} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-27 17:34:36,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {279#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-27 17:34:36,696 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 17:34:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:34:36,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198446196] [2022-04-27 17:34:36,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198446196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:34:36,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:34:36,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:34:36,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114797643] [2022-04-27 17:34:36,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:34:36,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 17:34:36,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:34:36,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 17:34:36,710 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 17:34:36,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:34:36,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:34:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:34:36,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:34:36,711 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 17:34:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:37,260 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 17:34:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:34:37,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 17:34:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:34:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 17:34:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-27 17:34:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 17:34:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-27 17:34:37,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-27 17:34:37,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:37,316 INFO L225 Difference]: With dead ends: 32 [2022-04-27 17:34:37,317 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 17:34:37,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 17:34:37,318 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:34:37,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:34:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 17:34:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 17:34:37,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:34:37,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:37,322 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:37,323 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:37,325 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 17:34:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 17:34:37,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:37,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:37,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 17:34:37,326 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 17:34:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:37,328 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 17:34:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 17:34:37,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:37,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:37,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:34:37,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:34:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 17:34:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 17:34:37,331 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-27 17:34:37,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:34:37,331 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 17:34:37,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 17:34:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 17:34:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 17:34:37,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:34:37,332 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:34:37,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 17:34:37,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:34:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:34:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-04-27 17:34:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:34:37,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511688053] [2022-04-27 17:34:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:34:37,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:34:37,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199020972] [2022-04-27 17:34:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:37,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:34:37,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:34:37,346 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 17:34:37,348 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 17:34:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:37,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:34:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:37,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:34:37,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 17:34:37,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {425#true} is VALID [2022-04-27 17:34:37,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 17:34:37,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 17:34:37,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 17:34:37,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 17:34:37,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 17:34:37,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 17:34:37,530 INFO L272 TraceCheckUtils]: 8: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {425#true} is VALID [2022-04-27 17:34:37,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {425#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {425#true} is VALID [2022-04-27 17:34:37,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {425#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 17:34:37,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-27 17:34:37,532 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {425#true} {445#(and (= main_~n~0 0) (= main_~y~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 17:34:37,533 INFO L272 TraceCheckUtils]: 13: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:34:37,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {470#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:34:37,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-27 17:34:37,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {426#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-27 17:34:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:34:37,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:34:37,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:34:37,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511688053] [2022-04-27 17:34:37,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:34:37,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199020972] [2022-04-27 17:34:37,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199020972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:34:37,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:34:37,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:34:37,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084766384] [2022-04-27 17:34:37,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:34:37,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17 [2022-04-27 17:34:37,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:34:37,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17:34:37,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:37,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:34:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:34:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:34:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:34:37,556 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17:34:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:38,034 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 17:34:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:34:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17 [2022-04-27 17:34:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:34:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17:34:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:34:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17:34:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:34:38,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 17:34:38,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:38,112 INFO L225 Difference]: With dead ends: 48 [2022-04-27 17:34:38,113 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 17:34:38,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 17:34:38,114 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:34:38,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 133 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:34:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 17:34:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-27 17:34:38,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:34:38,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 17:34:38,121 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 17:34:38,122 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 17:34:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:38,128 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 17:34:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-27 17:34:38,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:38,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:38,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-27 17:34:38,129 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-27 17:34:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:38,134 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 17:34:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-27 17:34:38,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:38,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:38,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:34:38,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:34:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 17:34:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-27 17:34:38,137 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-27 17:34:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:34:38,137 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-27 17:34:38,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17:34:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-27 17:34:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 17:34:38,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:34:38,138 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:34:38,164 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 17:34:38,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:34:38,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:34:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:34:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-04-27 17:34:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:34:38,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753951414] [2022-04-27 17:34:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:34:38,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:34:38,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413259973] [2022-04-27 17:34:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:38,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:34:38,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:34:38,383 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 17:34:38,411 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 17:34:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:38,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:34:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:38,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:34:38,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {664#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-27 17:34:38,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {664#true} is VALID [2022-04-27 17:34:38,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {664#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-27 17:34:38,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {664#true} {664#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-27 17:34:38,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {664#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-27 17:34:38,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 17:34:38,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 17:34:38,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 17:34:38,572 INFO L272 TraceCheckUtils]: 8: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {664#true} is VALID [2022-04-27 17:34:38,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {664#true} is VALID [2022-04-27 17:34:38,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-27 17:34:38,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-27 17:34:38,574 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {664#true} {684#(and (= main_~x~0 0) (= main_~n~0 0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 17:34:38,574 INFO L272 TraceCheckUtils]: 13: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {664#true} is VALID [2022-04-27 17:34:38,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {664#true} is VALID [2022-04-27 17:34:38,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-27 17:34:38,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-27 17:34:38,575 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {664#true} {684#(and (= main_~x~0 0) (= main_~n~0 0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 17:34:38,576 INFO L272 TraceCheckUtils]: 18: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:34:38,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {728#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:34:38,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {728#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {665#false} is VALID [2022-04-27 17:34:38,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {665#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {665#false} is VALID [2022-04-27 17:34:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 17:34:38,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:34:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:34:38,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753951414] [2022-04-27 17:34:38,578 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:34:38,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413259973] [2022-04-27 17:34:38,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413259973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:34:38,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:34:38,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:34:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628668743] [2022-04-27 17:34:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:34:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 17:34:38,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:34:38,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:34:38,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:38,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:34:38,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:34:38,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:34:38,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:34:38,598 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:34:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:39,030 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 17:34:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:34:39,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 17:34:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:34:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:34:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:34:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:34:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:34:39,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 17:34:39,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:39,126 INFO L225 Difference]: With dead ends: 52 [2022-04-27 17:34:39,126 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 17:34:39,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 17:34:39,127 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:34:39,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:34:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 17:34:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 17:34:39,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:34:39,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:34:39,133 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:34:39,134 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:34:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:39,137 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 17:34:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 17:34:39,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:39,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:39,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-27 17:34:39,138 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-27 17:34:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:39,144 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 17:34:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 17:34:39,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:39,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:39,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:34:39,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:34:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:34:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-27 17:34:39,148 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-27 17:34:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:34:39,148 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-27 17:34:39,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:34:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-27 17:34:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 17:34:39,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:34:39,149 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:34:39,169 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 17:34:39,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:34:39,362 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:34:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:34:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-04-27 17:34:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:34:39,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112322098] [2022-04-27 17:34:39,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:34:39,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:34:39,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568586676] [2022-04-27 17:34:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:39,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:34:39,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:34:39,375 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 17:34:39,400 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 17:34:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:39,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:34:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:34:39,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:34:39,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {940#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {940#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {940#true} is VALID [2022-04-27 17:34:39,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {940#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {940#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {940#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 17:34:39,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 17:34:39,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 17:34:39,584 INFO L272 TraceCheckUtils]: 8: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {940#true} is VALID [2022-04-27 17:34:39,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-27 17:34:39,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,585 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 17:34:39,585 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {940#true} is VALID [2022-04-27 17:34:39,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-27 17:34:39,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,587 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 17:34:39,587 INFO L272 TraceCheckUtils]: 18: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {940#true} is VALID [2022-04-27 17:34:39,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-27 17:34:39,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-27 17:34:39,589 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 17:34:39,590 INFO L272 TraceCheckUtils]: 23: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:34:39,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {1015#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:34:39,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {1019#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {941#false} is VALID [2022-04-27 17:34:39,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {941#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {941#false} is VALID [2022-04-27 17:34:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 17:34:39,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:34:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:34:39,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112322098] [2022-04-27 17:34:39,592 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:34:39,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568586676] [2022-04-27 17:34:39,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568586676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:34:39,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:34:39,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:34:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720631784] [2022-04-27 17:34:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:34:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 17:34:39,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:34:39,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:34:39,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:39,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:34:39,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:34:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:34:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:34:39,612 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:34:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:39,946 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-27 17:34:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:34:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 17:34:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:34:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:34:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:34:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:34:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 17:34:39,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 17:34:40,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:34:40,013 INFO L225 Difference]: With dead ends: 60 [2022-04-27 17:34:40,013 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 17:34:40,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 17:34:40,014 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:34:40,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:34:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 17:34:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 17:34:40,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:34:40,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 17:34:40,019 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 17:34:40,019 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 17:34:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:40,021 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 17:34:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 17:34:40,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:40,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:40,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-27 17:34:40,022 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-27 17:34:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:34:40,025 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 17:34:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 17:34:40,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:34:40,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:34:40,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:34:40,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:34:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 17:34:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-27 17:34:40,027 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-27 17:34:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:34:40,028 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-27 17:34:40,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:34:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 17:34:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 17:34:40,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:34:40,029 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:34:40,052 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 17:34:40,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:34:40,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:34:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:34:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-04-27 17:34:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:34:40,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081370232] [2022-04-27 17:34:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:34:40,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:34:40,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510396528] [2022-04-27 17:34:40,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:34:40,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:34:40,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:34:40,260 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 17:34:40,266 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 17:34:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 17:34:40,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 17:34:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 17:34:40,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 17:34:40,369 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 17:34:40,370 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 17:34:40,396 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 17:34:40,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:34:40,589 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:34:40,592 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 17:34:40,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:34:40 BasicIcfg [2022-04-27 17:34:40,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 17:34:40,630 INFO L158 Benchmark]: Toolchain (without parser) took 6130.34ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 130.5MB in the beginning and 114.4MB in the end (delta: 16.1MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2022-04-27 17:34:40,631 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory was 147.5MB in the beginning and 147.4MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:34:40,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.50ms. Allocated memory is still 179.3MB. Free memory was 130.2MB in the beginning and 157.3MB in the end (delta: -27.1MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2022-04-27 17:34:40,631 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 179.3MB. Free memory was 157.3MB in the beginning and 155.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:34:40,631 INFO L158 Benchmark]: RCFGBuilder took 347.69ms. Allocated memory is still 179.3MB. Free memory was 155.5MB in the beginning and 143.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 17:34:40,631 INFO L158 Benchmark]: IcfgTransformer took 47.23ms. Allocated memory is still 179.3MB. Free memory was 143.9MB in the beginning and 142.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:34:40,632 INFO L158 Benchmark]: TraceAbstraction took 5368.57ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 141.8MB in the beginning and 114.9MB in the end (delta: 27.0MB). Peak memory consumption was 63.9MB. Max. memory is 8.0GB. [2022-04-27 17:34:40,633 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.13ms. Allocated memory is still 179.3MB. Free memory was 147.5MB in the beginning and 147.4MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.50ms. Allocated memory is still 179.3MB. Free memory was 130.2MB in the beginning and 157.3MB in the end (delta: -27.1MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 179.3MB. Free memory was 157.3MB in the beginning and 155.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 347.69ms. Allocated memory is still 179.3MB. Free memory was 155.5MB in the beginning and 143.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 47.23ms. Allocated memory is still 179.3MB. Free memory was 143.9MB in the beginning and 142.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5368.57ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 141.8MB in the beginning and 114.9MB in the end (delta: 27.0MB). Peak memory consumption was 63.9MB. 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=1, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=1, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<1 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=1, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=1, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND FALSE !(counter++<1) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=1, counter=2, n=1, x=1, y=7, z=12] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=2] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 244 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 3 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 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 17:34:40,659 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...