/usr/bin/java -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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 04:55:18,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 04:55:18,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 04:55:18,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 04:55:18,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 04:55:18,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 04:55:18,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 04:55:18,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 04:55:18,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 04:55:18,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 04:55:18,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 04:55:18,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 04:55:18,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 04:55:18,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 04:55:18,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 04:55:18,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 04:55:18,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 04:55:18,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 04:55:18,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 04:55:18,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 04:55:18,668 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 04:55:18,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 04:55:18,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 04:55:18,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 04:55:18,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 04:55:18,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 04:55:18,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 04:55:18,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 04:55:18,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 04:55:18,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 04:55:18,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 04:55:18,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 04:55:18,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 04:55:18,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 04:55:18,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 04:55:18,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 04:55:18,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 04:55:18,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 04:55:18,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 04:55:18,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 04:55:18,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 04:55:18,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 04:55:18,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 04:55:18,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 04:55:18,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 04:55:18,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 04:55:18,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 04:55:18,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 04:55:18,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 04:55:18,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 04:55:18,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 04:55:18,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 04:55:18,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 04:55:18,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 04:55:18,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 04:55:18,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 04:55:18,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 04:55:18,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 04:55:18,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 04:55:18,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 04:55:18,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 04:55:18,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:55:18,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 04:55:18,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 04:55:18,694 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 04:55:18,694 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-03-20 04:55:18,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 04:55:18,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 04:55:18,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 04:55:18,890 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 04:55:18,890 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 04:55:18,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-03-20 04:55:18,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a06ec4bad/10af37ca4c7a4003bf0afe53f61d0efd/FLAGf6fd1e3c7 [2022-03-20 04:55:19,269 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 04:55:19,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-03-20 04:55:19,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a06ec4bad/10af37ca4c7a4003bf0afe53f61d0efd/FLAGf6fd1e3c7 [2022-03-20 04:55:19,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a06ec4bad/10af37ca4c7a4003bf0afe53f61d0efd [2022-03-20 04:55:19,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 04:55:19,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 04:55:19,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 04:55:19,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 04:55:19,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 04:55:19,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528dcd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19, skipping insertion in model container [2022-03-20 04:55:19,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 04:55:19,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 04:55:19,875 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_unwindbound20.c[588,601] [2022-03-20 04:55:19,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:55:19,914 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 04:55:19,924 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_unwindbound20.c[588,601] [2022-03-20 04:55:19,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:55:19,949 INFO L208 MainTranslator]: Completed translation [2022-03-20 04:55:19,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19 WrapperNode [2022-03-20 04:55:19,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 04:55:19,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 04:55:19,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 04:55:19,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 04:55:19,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 04:55:19,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 04:55:19,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 04:55:19,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 04:55:19,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (1/1) ... [2022-03-20 04:55:19,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:55:19,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:20,008 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-03-20 04:55:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 04:55:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 04:55:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 04:55:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 04:55:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 04:55:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 04:55:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 04:55:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 04:55:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 04:55:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 04:55:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-03-20 04:55:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 04:55:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 04:55:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 04:55:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 04:55:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 04:55:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 04:55:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 04:55:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 04:55:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 04:55:20,029 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-03-20 04:55:20,089 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 04:55:20,090 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 04:55:20,226 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 04:55:20,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 04:55:20,230 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 04:55:20,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:55:20 BoogieIcfgContainer [2022-03-20 04:55:20,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 04:55:20,241 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 04:55:20,241 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 04:55:20,256 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 04:55:20,258 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:55:20" (1/1) ... [2022-03-20 04:55:20,259 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 04:55:20,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:55:20 BasicIcfg [2022-03-20 04:55:20,269 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 04:55:20,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 04:55:20,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 04:55:20,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 04:55:20,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:55:19" (1/4) ... [2022-03-20 04:55:20,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd1460a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:55:20, skipping insertion in model container [2022-03-20 04:55:20,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:55:19" (2/4) ... [2022-03-20 04:55:20,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd1460a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:55:20, skipping insertion in model container [2022-03-20 04:55:20,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:55:20" (3/4) ... [2022-03-20 04:55:20,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd1460a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:55:20, skipping insertion in model container [2022-03-20 04:55:20,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:55:20" (4/4) ... [2022-03-20 04:55:20,288 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.cJordan [2022-03-20 04:55:20,291 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 04:55:20,291 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 04:55:20,316 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 04:55:20,320 INFO L340 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 [2022-03-20 04:55:20,320 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 04:55:20,328 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-03-20 04:55:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 04:55:20,335 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:20,335 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:20,335 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-03-20 04:55:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:20,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498528032] [2022-03-20 04:55:20,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:20,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:55:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:55:20,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:20,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498528032] [2022-03-20 04:55:20,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498528032] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:55:20,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:55:20,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 04:55:20,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219116615] [2022-03-20 04:55:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:55:20,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 04:55:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 04:55:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:55:20,541 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-03-20 04:55:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:20,625 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-03-20 04:55:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 04:55:20,626 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-03-20 04:55:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:20,634 INFO L225 Difference]: With dead ends: 32 [2022-03-20 04:55:20,634 INFO L226 Difference]: Without dead ends: 27 [2022-03-20 04:55:20,635 INFO L912 BasicCegarLoop]: 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-03-20 04:55:20,639 INFO L913 BasicCegarLoop]: 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-03-20 04:55:20,640 INFO L914 BasicCegarLoop]: 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-03-20 04:55:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-20 04:55:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-03-20 04:55:20,668 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-03-20 04:55:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-03-20 04:55:20,670 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-03-20 04:55:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:20,671 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-03-20 04:55:20,671 INFO L479 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-03-20 04:55:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-03-20 04:55:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-20 04:55:20,672 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:20,672 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:20,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 04:55:20,672 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-03-20 04:55:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085821377] [2022-03-20 04:55:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:20,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:20,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:55:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:55:20,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:20,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085821377] [2022-03-20 04:55:20,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085821377] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:55:20,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:55:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 04:55:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527033571] [2022-03-20 04:55:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:55:20,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 04:55:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 04:55:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 04:55:20,784 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-03-20 04:55:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:20,858 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-03-20 04:55:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 04:55:20,859 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-03-20 04:55:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:20,860 INFO L225 Difference]: With dead ends: 28 [2022-03-20 04:55:20,860 INFO L226 Difference]: Without dead ends: 28 [2022-03-20 04:55:20,860 INFO L912 BasicCegarLoop]: 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-03-20 04:55:20,861 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-20 04:55:20,861 INFO L914 BasicCegarLoop]: 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-03-20 04:55:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-20 04:55:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-03-20 04:55:20,865 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-03-20 04:55:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-03-20 04:55:20,866 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-03-20 04:55:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:20,866 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-03-20 04:55:20,866 INFO L479 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-03-20 04:55:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-03-20 04:55:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-20 04:55:20,867 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:20,867 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:20,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 04:55:20,867 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-03-20 04:55:20,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:20,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231167780] [2022-03-20 04:55:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:55:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:55:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:20,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231167780] [2022-03-20 04:55:20,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231167780] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:55:20,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:55:20,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 04:55:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260814368] [2022-03-20 04:55:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:55:20,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 04:55:20,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:20,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 04:55:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 04:55:20,944 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-03-20 04:55:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:21,070 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-03-20 04:55:21,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:55:21,071 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-03-20 04:55:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:21,072 INFO L225 Difference]: With dead ends: 32 [2022-03-20 04:55:21,072 INFO L226 Difference]: Without dead ends: 32 [2022-03-20 04:55:21,072 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 04:55:21,073 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:21,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-20 04:55:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-20 04:55:21,077 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-03-20 04:55:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-03-20 04:55:21,078 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-03-20 04:55:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:21,078 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-03-20 04:55:21,078 INFO L479 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-03-20 04:55:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-03-20 04:55:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:55:21,078 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:21,078 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:21,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 04:55:21,079 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:21,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-03-20 04:55:21,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:21,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211471286] [2022-03-20 04:55:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:21,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:21,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333710504] [2022-03-20 04:55:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:21,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:21,089 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-03-20 04:55:21,090 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-03-20 04:55:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:21,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:55:21,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:55:21,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:55:21,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:21,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211471286] [2022-03-20 04:55:21,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:21,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333710504] [2022-03-20 04:55:21,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333710504] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:55:21,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:55:21,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 04:55:21,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300242098] [2022-03-20 04:55:21,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:55:21,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 04:55:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:21,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 04:55:21,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 04:55:21,236 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-03-20 04:55:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:21,279 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-03-20 04:55:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 04:55:21,279 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-03-20 04:55:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:21,280 INFO L225 Difference]: With dead ends: 48 [2022-03-20 04:55:21,280 INFO L226 Difference]: Without dead ends: 48 [2022-03-20 04:55:21,280 INFO L912 BasicCegarLoop]: 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-03-20 04:55:21,281 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:21,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 153 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:55:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-20 04:55:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-03-20 04:55:21,285 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-03-20 04:55:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-03-20 04:55:21,286 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-03-20 04:55:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:21,286 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-03-20 04:55:21,287 INFO L479 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-03-20 04:55:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-03-20 04:55:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 04:55:21,287 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:21,287 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:21,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-20 04:55:21,508 WARN L460 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-03-20 04:55:21,508 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-03-20 04:55:21,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:21,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262882674] [2022-03-20 04:55:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:21,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:21,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:21,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099208697] [2022-03-20 04:55:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:21,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:21,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:21,524 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-03-20 04:55:21,524 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-03-20 04:55:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:21,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:55:21,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 04:55:21,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:55:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:21,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262882674] [2022-03-20 04:55:21,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:21,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099208697] [2022-03-20 04:55:21,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099208697] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:55:21,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:55:21,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 04:55:21,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128128553] [2022-03-20 04:55:21,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:55:21,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 04:55:21,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 04:55:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 04:55:21,667 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-03-20 04:55:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:21,705 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-03-20 04:55:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 04:55:21,705 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-03-20 04:55:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:21,706 INFO L225 Difference]: With dead ends: 52 [2022-03-20 04:55:21,706 INFO L226 Difference]: Without dead ends: 52 [2022-03-20 04:55:21,706 INFO L912 BasicCegarLoop]: 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-03-20 04:55:21,707 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:21,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 150 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:55:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-20 04:55:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-03-20 04:55:21,711 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-03-20 04:55:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-03-20 04:55:21,712 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-03-20 04:55:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:21,712 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-03-20 04:55:21,713 INFO L479 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-03-20 04:55:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-03-20 04:55:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-20 04:55:21,713 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:21,713 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:21,733 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-03-20 04:55:21,925 WARN L460 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-03-20 04:55:21,926 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:21,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-03-20 04:55:21,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:21,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181600850] [2022-03-20 04:55:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:21,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:21,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132495260] [2022-03-20 04:55:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:21,939 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-03-20 04:55:21,961 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-03-20 04:55:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:21,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:55:21,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 04:55:22,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:55:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:22,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181600850] [2022-03-20 04:55:22,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:22,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132495260] [2022-03-20 04:55:22,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132495260] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:55:22,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:55:22,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 04:55:22,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904344400] [2022-03-20 04:55:22,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:55:22,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 04:55:22,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:22,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 04:55:22,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 04:55:22,115 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-03-20 04:55:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:22,164 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-03-20 04:55:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 04:55:22,164 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-03-20 04:55:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:22,165 INFO L225 Difference]: With dead ends: 60 [2022-03-20 04:55:22,165 INFO L226 Difference]: Without dead ends: 50 [2022-03-20 04:55:22,165 INFO L912 BasicCegarLoop]: 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-03-20 04:55:22,166 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:22,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 151 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:55:22,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-20 04:55:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-03-20 04:55:22,169 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-03-20 04:55:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-03-20 04:55:22,170 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-03-20 04:55:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:22,170 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-03-20 04:55:22,170 INFO L479 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-03-20 04:55:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-03-20 04:55:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 04:55:22,171 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:22,171 INFO L499 BasicCegarLoop]: 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-03-20 04:55:22,190 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-03-20 04:55:22,387 WARN L460 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-03-20 04:55:22,388 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-03-20 04:55:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:22,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667150273] [2022-03-20 04:55:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:22,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:22,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528054624] [2022-03-20 04:55:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:22,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:22,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:22,398 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-03-20 04:55:22,408 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-03-20 04:55:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:22,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:55:22,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-20 04:55:22,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-20 04:55:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:22,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667150273] [2022-03-20 04:55:22,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:22,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528054624] [2022-03-20 04:55:22,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528054624] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:55:22,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:55:22,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-03-20 04:55:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427282977] [2022-03-20 04:55:22,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:22,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:55:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:22,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:55:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-20 04:55:22,635 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-03-20 04:55:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:22,764 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-03-20 04:55:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:55:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-03-20 04:55:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:22,769 INFO L225 Difference]: With dead ends: 104 [2022-03-20 04:55:22,769 INFO L226 Difference]: Without dead ends: 104 [2022-03-20 04:55:22,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-20 04:55:22,770 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:22,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 191 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-03-20 04:55:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-03-20 04:55:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-20 04:55:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-03-20 04:55:22,777 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-03-20 04:55:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:22,777 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-03-20 04:55:22,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-03-20 04:55:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-03-20 04:55:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 04:55:22,778 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:22,778 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:22,797 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-03-20 04:55:22,997 WARN L460 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-03-20 04:55:22,998 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-03-20 04:55:22,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:22,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047910406] [2022-03-20 04:55:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:23,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:23,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021627235] [2022-03-20 04:55:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:23,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:23,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:23,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-20 04:55:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:23,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:55:23,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-20 04:55:23,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-20 04:55:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:23,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047910406] [2022-03-20 04:55:23,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:23,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021627235] [2022-03-20 04:55:23,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021627235] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:55:23,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:55:23,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-20 04:55:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024618903] [2022-03-20 04:55:23,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:23,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:55:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:23,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:55:23,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-20 04:55:23,246 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-03-20 04:55:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:23,494 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-03-20 04:55:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:55:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-03-20 04:55:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:23,496 INFO L225 Difference]: With dead ends: 116 [2022-03-20 04:55:23,496 INFO L226 Difference]: Without dead ends: 116 [2022-03-20 04:55:23,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-20 04:55:23,496 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:23,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 188 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 04:55:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-03-20 04:55:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-03-20 04:55:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-20 04:55:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-03-20 04:55:23,503 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-03-20 04:55:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:23,503 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-03-20 04:55:23,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-03-20 04:55:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-03-20 04:55:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 04:55:23,504 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:23,504 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:23,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:23,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:23,714 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-03-20 04:55:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:23,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045590414] [2022-03-20 04:55:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:23,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:23,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730540137] [2022-03-20 04:55:23,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:55:23,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:23,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:23,722 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:23,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-20 04:55:23,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:55:23,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:23,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:55:23,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-03-20 04:55:23,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-03-20 04:55:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045590414] [2022-03-20 04:55:23,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730540137] [2022-03-20 04:55:23,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730540137] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:55:23,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:55:23,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-20 04:55:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272542161] [2022-03-20 04:55:23,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:23,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:55:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:55:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-20 04:55:23,980 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-03-20 04:55:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:24,047 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-03-20 04:55:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 04:55:24,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-03-20 04:55:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:24,048 INFO L225 Difference]: With dead ends: 120 [2022-03-20 04:55:24,048 INFO L226 Difference]: Without dead ends: 120 [2022-03-20 04:55:24,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-03-20 04:55:24,049 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:24,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 263 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-03-20 04:55:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-03-20 04:55:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-03-20 04:55:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-03-20 04:55:24,063 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-03-20 04:55:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:24,064 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-03-20 04:55:24,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-03-20 04:55:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-03-20 04:55:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-20 04:55:24,066 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:24,066 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:24,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:24,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:24,271 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-03-20 04:55:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:24,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808951119] [2022-03-20 04:55:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:24,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:24,277 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:24,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765478398] [2022-03-20 04:55:24,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 04:55:24,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:24,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:24,279 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:24,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-20 04:55:24,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-20 04:55:24,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:24,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-20 04:55:24,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-20 04:55:24,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-20 04:55:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:24,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808951119] [2022-03-20 04:55:24,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:24,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765478398] [2022-03-20 04:55:24,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765478398] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:55:24,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:55:24,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-03-20 04:55:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17160086] [2022-03-20 04:55:24,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:24,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:55:24,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:55:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-20 04:55:24,728 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-03-20 04:55:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:24,940 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2022-03-20 04:55:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:55:24,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-03-20 04:55:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:24,942 INFO L225 Difference]: With dead ends: 144 [2022-03-20 04:55:24,942 INFO L226 Difference]: Without dead ends: 135 [2022-03-20 04:55:24,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-20 04:55:24,942 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:24,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 04:55:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-03-20 04:55:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-03-20 04:55:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-20 04:55:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-03-20 04:55:24,948 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-03-20 04:55:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:24,948 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-03-20 04:55:24,948 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-03-20 04:55:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-03-20 04:55:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-20 04:55:24,949 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:24,949 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:24,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:25,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:25,159 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-03-20 04:55:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:25,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4843988] [2022-03-20 04:55:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:25,166 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:25,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212134862] [2022-03-20 04:55:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:25,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:25,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:25,168 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:25,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-20 04:55:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:25,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-20 04:55:25,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-03-20 04:55:25,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-03-20 04:55:26,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:26,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4843988] [2022-03-20 04:55:26,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:26,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212134862] [2022-03-20 04:55:26,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212134862] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:55:26,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:55:26,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-03-20 04:55:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040980804] [2022-03-20 04:55:26,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:26,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 04:55:26,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:26,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 04:55:26,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-20 04:55:26,026 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-03-20 04:55:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:26,282 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-03-20 04:55:26,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:55:26,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-03-20 04:55:26,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:26,284 INFO L225 Difference]: With dead ends: 146 [2022-03-20 04:55:26,284 INFO L226 Difference]: Without dead ends: 144 [2022-03-20 04:55:26,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:55:26,285 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:26,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 225 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-20 04:55:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-03-20 04:55:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-03-20 04:55:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-03-20 04:55:26,292 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-03-20 04:55:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:26,292 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-03-20 04:55:26,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-03-20 04:55:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-03-20 04:55:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-20 04:55:26,293 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:26,293 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:26,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-20 04:55:26,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-20 04:55:26,495 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash -601883655, now seen corresponding path program 1 times [2022-03-20 04:55:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:26,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197941357] [2022-03-20 04:55:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:26,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:26,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141851333] [2022-03-20 04:55:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:26,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:26,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:26,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:26,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-20 04:55:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:55:26,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-20 04:55:26,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-03-20 04:55:26,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:26,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:26,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197941357] [2022-03-20 04:55:26,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:26,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141851333] [2022-03-20 04:55:26,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141851333] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:55:26,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:55:26,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-03-20 04:55:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099759227] [2022-03-20 04:55:26,961 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:26,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:55:26,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:55:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-03-20 04:55:26,962 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-03-20 04:55:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:27,030 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-03-20 04:55:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:55:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-03-20 04:55:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:27,032 INFO L225 Difference]: With dead ends: 141 [2022-03-20 04:55:27,032 INFO L226 Difference]: Without dead ends: 132 [2022-03-20 04:55:27,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 04:55:27,032 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:27,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-20 04:55:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-03-20 04:55:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-20 04:55:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-03-20 04:55:27,036 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-03-20 04:55:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:27,036 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-03-20 04:55:27,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-03-20 04:55:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-03-20 04:55:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-20 04:55:27,037 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:27,037 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:27,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:27,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:27,254 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1157335722, now seen corresponding path program 4 times [2022-03-20 04:55:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:27,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8054593] [2022-03-20 04:55:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:27,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:27,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58378899] [2022-03-20 04:55:27,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 04:55:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:27,265 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:27,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-20 04:55:29,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 04:55:29,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:29,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-20 04:55:29,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 104 proven. 43 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-03-20 04:55:29,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-03-20 04:55:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8054593] [2022-03-20 04:55:30,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58378899] [2022-03-20 04:55:30,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58378899] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:55:30,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:55:30,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-03-20 04:55:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610713705] [2022-03-20 04:55:30,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:30,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 04:55:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:30,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 04:55:30,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:55:30,207 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-03-20 04:55:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:30,308 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2022-03-20 04:55:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:55:30,309 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-03-20 04:55:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:30,309 INFO L225 Difference]: With dead ends: 140 [2022-03-20 04:55:30,309 INFO L226 Difference]: Without dead ends: 138 [2022-03-20 04:55:30,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-03-20 04:55:30,310 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:30,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 98 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-20 04:55:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-03-20 04:55:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-03-20 04:55:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-03-20 04:55:30,314 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-03-20 04:55:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:30,314 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-03-20 04:55:30,314 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-03-20 04:55:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-03-20 04:55:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-20 04:55:30,315 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:30,315 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:30,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:30,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-20 04:55:30,516 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash -821976909, now seen corresponding path program 2 times [2022-03-20 04:55:30,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:30,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515286556] [2022-03-20 04:55:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:30,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:30,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160452729] [2022-03-20 04:55:30,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:55:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:30,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:30,528 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:30,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-20 04:55:30,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:55:30,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:30,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-20 04:55:30,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-03-20 04:55:30,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:31,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515286556] [2022-03-20 04:55:31,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:31,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160452729] [2022-03-20 04:55:31,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160452729] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:55:31,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:55:31,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-03-20 04:55:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262432321] [2022-03-20 04:55:31,059 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:31,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:55:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:31,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:55:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-20 04:55:31,060 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-20 04:55:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:31,163 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-03-20 04:55:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:55:31,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-03-20 04:55:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:31,164 INFO L225 Difference]: With dead ends: 138 [2022-03-20 04:55:31,164 INFO L226 Difference]: Without dead ends: 129 [2022-03-20 04:55:31,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-03-20 04:55:31,165 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:31,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 277 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-20 04:55:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-03-20 04:55:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-20 04:55:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-03-20 04:55:31,168 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-03-20 04:55:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:31,168 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-03-20 04:55:31,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-20 04:55:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-03-20 04:55:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-03-20 04:55:31,169 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:31,169 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:31,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:31,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-20 04:55:31,370 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1992307858, now seen corresponding path program 2 times [2022-03-20 04:55:31,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:31,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345930343] [2022-03-20 04:55:31,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:31,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:31,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657690152] [2022-03-20 04:55:31,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:55:31,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:31,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:31,377 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:31,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-20 04:55:31,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:55:31,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:31,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-20 04:55:31,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-03-20 04:55:31,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:32,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:32,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345930343] [2022-03-20 04:55:32,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:32,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657690152] [2022-03-20 04:55:32,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657690152] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:55:32,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:55:32,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-20 04:55:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859479183] [2022-03-20 04:55:32,080 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:32,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 04:55:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:32,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 04:55:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-20 04:55:32,080 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-03-20 04:55:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:32,222 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-03-20 04:55:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:55:32,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-03-20 04:55:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:32,223 INFO L225 Difference]: With dead ends: 150 [2022-03-20 04:55:32,223 INFO L226 Difference]: Without dead ends: 150 [2022-03-20 04:55:32,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:55:32,224 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:32,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 371 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-03-20 04:55:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-03-20 04:55:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-03-20 04:55:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-03-20 04:55:32,227 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-03-20 04:55:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:32,227 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-03-20 04:55:32,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-03-20 04:55:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-03-20 04:55:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-03-20 04:55:32,228 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:32,228 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:32,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:32,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-20 04:55:32,439 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:32,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1089028459, now seen corresponding path program 2 times [2022-03-20 04:55:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:32,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791287253] [2022-03-20 04:55:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:32,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:32,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:32,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302070719] [2022-03-20 04:55:32,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:55:32,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:32,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:32,447 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:32,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-20 04:55:32,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:55:32,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:32,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:55:32,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-03-20 04:55:32,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-03-20 04:55:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:32,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791287253] [2022-03-20 04:55:32,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:32,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302070719] [2022-03-20 04:55:32,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302070719] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:55:32,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:55:32,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-03-20 04:55:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16773566] [2022-03-20 04:55:32,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:32,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 04:55:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:32,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 04:55:32,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:55:32,930 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-03-20 04:55:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:33,209 INFO L93 Difference]: Finished difference Result 355 states and 369 transitions. [2022-03-20 04:55:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-20 04:55:33,209 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-03-20 04:55:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:33,210 INFO L225 Difference]: With dead ends: 355 [2022-03-20 04:55:33,210 INFO L226 Difference]: Without dead ends: 353 [2022-03-20 04:55:33,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-03-20 04:55:33,211 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 148 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:33,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 370 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 04:55:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-03-20 04:55:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-03-20 04:55:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-03-20 04:55:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-03-20 04:55:33,225 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-03-20 04:55:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:33,227 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-03-20 04:55:33,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-03-20 04:55:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-03-20 04:55:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-20 04:55:33,228 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:33,228 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:33,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:33,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-20 04:55:33,435 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -925808019, now seen corresponding path program 3 times [2022-03-20 04:55:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:33,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816068551] [2022-03-20 04:55:33,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:33,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:33,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584077379] [2022-03-20 04:55:33,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 04:55:33,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:33,448 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:33,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-20 04:55:33,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 04:55:33,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:33,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-20 04:55:33,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-03-20 04:55:34,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:34,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:34,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816068551] [2022-03-20 04:55:34,427 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:34,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584077379] [2022-03-20 04:55:34,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584077379] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:55:34,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:55:34,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-20 04:55:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901610531] [2022-03-20 04:55:34,427 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:34,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 04:55:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 04:55:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-20 04:55:34,428 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-03-20 04:55:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:34,554 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-03-20 04:55:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:55:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-03-20 04:55:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:34,556 INFO L225 Difference]: With dead ends: 311 [2022-03-20 04:55:34,556 INFO L226 Difference]: Without dead ends: 302 [2022-03-20 04:55:34,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:55:34,557 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:34,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 372 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:55:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-03-20 04:55:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-03-20 04:55:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-03-20 04:55:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-03-20 04:55:34,563 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-03-20 04:55:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:34,563 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-03-20 04:55:34,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-03-20 04:55:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-03-20 04:55:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-03-20 04:55:34,564 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:34,564 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:34,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:34,769 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:34,770 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:34,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash 386125940, now seen corresponding path program 3 times [2022-03-20 04:55:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:34,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581774844] [2022-03-20 04:55:34,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:34,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462112628] [2022-03-20 04:55:34,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 04:55:34,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:34,781 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:34,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-20 04:55:35,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-20 04:55:35,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:35,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:55:35,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:55:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-03-20 04:55:35,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:55:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:55:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581774844] [2022-03-20 04:55:37,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:55:37,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462112628] [2022-03-20 04:55:37,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462112628] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:55:37,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:55:37,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-20 04:55:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383416032] [2022-03-20 04:55:37,498 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 04:55:37,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 04:55:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:55:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 04:55:37,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-03-20 04:55:37,499 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-20 04:55:39,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:55:41,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 04:55:42,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 04:55:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:55:42,245 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-03-20 04:55:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:55:42,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-03-20 04:55:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:55:42,247 INFO L225 Difference]: With dead ends: 309 [2022-03-20 04:55:42,247 INFO L226 Difference]: Without dead ends: 309 [2022-03-20 04:55:42,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2022-03-20 04:55:42,247 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-20 04:55:42,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 134 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-03-20 04:55:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-03-20 04:55:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-03-20 04:55:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-03-20 04:55:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-03-20 04:55:42,255 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-03-20 04:55:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:55:42,256 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-03-20 04:55:42,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-20 04:55:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-03-20 04:55:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-20 04:55:42,257 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:55:42,257 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:55:42,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-20 04:55:42,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-20 04:55:42,462 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:55:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:55:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash -939165401, now seen corresponding path program 4 times [2022-03-20 04:55:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:55:42,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753592722] [2022-03-20 04:55:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:55:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:55:42,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:55:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527029772] [2022-03-20 04:55:42,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 04:55:42,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:55:42,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:55:42,472 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:55:42,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-20 04:55:44,325 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 04:55:44,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:55:44,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-20 04:55:44,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:56:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 252 proven. 354 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2022-03-20 04:56:03,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:56:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 219 proven. 17 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2022-03-20 04:56:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:56:07,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753592722] [2022-03-20 04:56:07,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:56:07,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527029772] [2022-03-20 04:56:07,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527029772] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:56:07,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:56:07,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-03-20 04:56:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653919886] [2022-03-20 04:56:07,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:56:07,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 04:56:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:56:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 04:56:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=242, Unknown=1, NotChecked=0, Total=306 [2022-03-20 04:56:07,590 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-03-20 04:56:09,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 04:56:12,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 04:56:15,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 04:56:18,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 04:56:20,294 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 04:56:22,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 04:56:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:56:22,949 INFO L93 Difference]: Finished difference Result 313 states and 326 transitions. [2022-03-20 04:56:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:56:22,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-03-20 04:56:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:56:22,950 INFO L225 Difference]: With dead ends: 313 [2022-03-20 04:56:22,951 INFO L226 Difference]: Without dead ends: 294 [2022-03-20 04:56:22,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 300 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=124, Invalid=427, Unknown=1, NotChecked=0, Total=552 [2022-03-20 04:56:22,951 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 70 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-03-20 04:56:22,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 229 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 174 Invalid, 5 Unknown, 0 Unchecked, 12.9s Time] [2022-03-20 04:56:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-03-20 04:56:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-03-20 04:56:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-03-20 04:56:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-03-20 04:56:22,956 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-03-20 04:56:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:56:22,956 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-03-20 04:56:22,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-03-20 04:56:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-03-20 04:56:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-03-20 04:56:22,958 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:56:22,958 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:56:22,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-20 04:56:23,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:56:23,165 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:56:23,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:56:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1419180943, now seen corresponding path program 3 times [2022-03-20 04:56:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:56:23,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475533752] [2022-03-20 04:56:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:56:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:56:23,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:56:23,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998466527] [2022-03-20 04:56:23,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 04:56:23,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:56:23,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:56:23,184 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:56:23,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-20 04:56:23,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-03-20 04:56:23,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:56:23,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-20 04:56:23,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:56:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-03-20 04:56:23,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:56:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-03-20 04:56:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:56:24,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475533752] [2022-03-20 04:56:24,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 04:56:24,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998466527] [2022-03-20 04:56:24,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998466527] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:56:24,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 04:56:24,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-03-20 04:56:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278733601] [2022-03-20 04:56:24,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 04:56:24,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-20 04:56:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:56:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-20 04:56:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-20 04:56:24,467 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-03-20 04:56:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:56:24,969 INFO L93 Difference]: Finished difference Result 574 states and 575 transitions. [2022-03-20 04:56:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-20 04:56:24,970 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) Word has length 297 [2022-03-20 04:56:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:56:24,971 INFO L225 Difference]: With dead ends: 574 [2022-03-20 04:56:24,971 INFO L226 Difference]: Without dead ends: 574 [2022-03-20 04:56:24,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-03-20 04:56:24,972 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 162 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 04:56:24,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 482 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 04:56:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-03-20 04:56:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2022-03-20 04:56:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-03-20 04:56:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2022-03-20 04:56:24,981 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 297 [2022-03-20 04:56:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:56:24,984 INFO L478 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2022-03-20 04:56:24,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-03-20 04:56:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-03-20 04:56:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2022-03-20 04:56:24,988 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:56:24,988 INFO L499 BasicCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:56:24,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-20 04:56:25,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:56:25,194 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:56:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:56:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1448321483, now seen corresponding path program 4 times [2022-03-20 04:56:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:56:25,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773583531] [2022-03-20 04:56:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:56:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:56:25,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 04:56:25,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764332344] [2022-03-20 04:56:25,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 04:56:25,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:56:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:56:25,218 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:56:25,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-20 04:56:25,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 04:56:25,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-20 04:56:25,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 04:56:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 04:56:25,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 04:56:25,965 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 04:56:25,965 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 04:56:25,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-20 04:56:26,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:56:26,177 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-03-20 04:56:26,185 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 04:56:26,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:56:26 BasicIcfg [2022-03-20 04:56:26,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 04:56:26,303 INFO L158 Benchmark]: Toolchain (without parser) took 66599.86ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 138.2MB in the beginning and 200.3MB in the end (delta: -62.1MB). Peak memory consumption was 32.4MB. Max. memory is 8.0GB. [2022-03-20 04:56:26,303 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 04:56:26,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.01ms. Allocated memory is still 194.0MB. Free memory was 138.1MB in the beginning and 167.9MB in the end (delta: -29.8MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-03-20 04:56:26,303 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 194.0MB. Free memory was 167.9MB in the beginning and 166.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 04:56:26,303 INFO L158 Benchmark]: RCFGBuilder took 248.67ms. Allocated memory is still 194.0MB. Free memory was 166.3MB in the beginning and 155.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 04:56:26,303 INFO L158 Benchmark]: IcfgTransformer took 28.04ms. Allocated memory is still 194.0MB. Free memory was 154.8MB in the beginning and 153.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 04:56:26,304 INFO L158 Benchmark]: TraceAbstraction took 66032.22ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 153.2MB in the beginning and 200.3MB in the end (delta: -47.2MB). Peak memory consumption was 48.3MB. Max. memory is 8.0GB. [2022-03-20 04:56:26,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.01ms. Allocated memory is still 194.0MB. Free memory was 138.1MB in the beginning and 167.9MB in the end (delta: -29.8MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 194.0MB. Free memory was 167.9MB in the beginning and 166.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 248.67ms. Allocated memory is still 194.0MB. Free memory was 166.3MB in the beginning and 155.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 28.04ms. Allocated memory is still 194.0MB. Free memory was 154.8MB in the beginning and 153.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 66032.22ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 153.2MB in the beginning and 200.3MB in the end (delta: -47.2MB). Peak memory consumption was 48.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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)=26, 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=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [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=20, 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=20, 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=20, 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=20, 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=20, 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=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] 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] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [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=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [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=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [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=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [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=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [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=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [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=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [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=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [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=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [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=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [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=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [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=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [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=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [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=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [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=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [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=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [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=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [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=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [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=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [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=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.9s, OverallIterations: 21, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 607 SdHoareTripleChecker+Valid, 19.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 550 mSDsluCounter, 4253 SdHoareTripleChecker+Invalid, 19.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3279 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2400 IncrementalHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 974 mSDtfsCounter, 2400 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2767 GetRequests, 2522 SyntacticMatches, 21 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=20, InterpolantAutomatonStates: 195, 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, 20 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 2202 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2526 ConstructedInterpolants, 0 QuantifiedInterpolants, 10522 SizeOfPredicates, 62 NumberOfNonLiveVariables, 3444 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 15720/22306 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-03-20 04:56:26,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...