/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/mannadiv_unwindbound100.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-7390193
[2022-04-05 03:35:57,811 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-05 03:35:57,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-05 03:35:57,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-05 03:35:57,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-05 03:35:57,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-05 03:35:57,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-05 03:35:57,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-05 03:35:57,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-05 03:35:57,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-05 03:35:57,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-05 03:35:57,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-05 03:35:57,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-05 03:35:57,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-05 03:35:57,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-05 03:35:57,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-05 03:35:57,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-05 03:35:57,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-05 03:35:57,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-05 03:35:57,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-05 03:35:57,869 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-05 03:35:57,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-05 03:35:57,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-05 03:35:57,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-05 03:35:57,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-05 03:35:57,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-05 03:35:57,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-05 03:35:57,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-05 03:35:57,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-05 03:35:57,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-05 03:35:57,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-05 03:35:57,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-05 03:35:57,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-05 03:35:57,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-05 03:35:57,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-05 03:35:57,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-05 03:35:57,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-05 03:35:57,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-05 03:35:57,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-05 03:35:57,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-05 03:35:57,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-05 03:35:57,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-05 03:35:57,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf
[2022-04-05 03:35:57,892 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-05 03:35:57,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-05 03:35:57,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-05 03:35:57,893 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-05 03:35:57,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-05 03:35:57,893 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-05 03:35:57,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-05 03:35:57,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-05 03:35:57,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-05 03:35:57,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-05 03:35:57,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-05 03:35:57,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-05 03:35:57,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-05 03:35:57,895 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-05 03:35:57,895 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-05 03:35:58,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-05 03:35:58,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-05 03:35:58,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-05 03:35:58,085 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-05 03:35:58,085 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-05 03:35:58,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound100.c
[2022-04-05 03:35:58,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfb04e88/3c31625e83ac49b48d449d07e17d40bf/FLAG1ed61f24b
[2022-04-05 03:35:58,454 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-05 03:35:58,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound100.c
[2022-04-05 03:35:58,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfb04e88/3c31625e83ac49b48d449d07e17d40bf/FLAG1ed61f24b
[2022-04-05 03:35:58,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfb04e88/3c31625e83ac49b48d449d07e17d40bf
[2022-04-05 03:35:58,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-05 03:35:58,469 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-05 03:35:58,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-05 03:35:58,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-05 03:35:58,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-05 03:35:58,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142b8750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58, skipping insertion in model container
[2022-04-05 03:35:58,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-05 03:35:58,487 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-05 03:35:58,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound100.c[573,586]
[2022-04-05 03:35:58,600 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-05 03:35:58,605 INFO L203 MainTranslator]: Completed pre-run
[2022-04-05 03:35:58,611 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/mannadiv_unwindbound100.c[573,586]
[2022-04-05 03:35:58,614 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-05 03:35:58,621 INFO L208 MainTranslator]: Completed translation
[2022-04-05 03:35:58,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58 WrapperNode
[2022-04-05 03:35:58,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-05 03:35:58,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-05 03:35:58,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-05 03:35:58,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-05 03:35:58,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-05 03:35:58,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-05 03:35:58,640 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-05 03:35:58,640 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-05 03:35:58,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-05 03:35:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:35:58,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-05 03:35:58,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-05 03:35:58,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-05 03:35:58,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-05 03:35:58,698 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-05 03:35:58,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-05 03:35:58,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-05 03:35:58,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-05 03:35:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-05 03:35:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-05 03:35:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-05 03:35:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-05 03:35:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-05 03:35:58,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-05 03:35:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-05 03:35:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-05 03:35:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-05 03:35:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-05 03:35:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-05 03:35:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-05 03:35:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-05 03:35:58,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-05 03:35:58,735 INFO L234 CfgBuilder]: Building ICFG
[2022-04-05 03:35:58,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-05 03:35:58,813 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-05 03:35:58,818 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-05 03:35:58,818 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-05 03:35:58,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:35:58 BoogieIcfgContainer
[2022-04-05 03:35:58,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-05 03:35:58,820 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-05 03:35:58,820 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-05 03:35:58,820 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-05 03:35:58,822 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:35:58" (1/1) ...
[2022-04-05 03:35:58,823 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN
[2022-04-05 03:35:58,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 03:35:58 BasicIcfg
[2022-04-05 03:35:58,834 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-05 03:35:58,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-05 03:35:58,835 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-05 03:35:58,837 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-05 03:35:58,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 03:35:58" (1/4) ...
[2022-04-05 03:35:58,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791cabed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:35:58, skipping insertion in model container
[2022-04-05 03:35:58,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:35:58" (2/4) ...
[2022-04-05 03:35:58,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791cabed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:35:58, skipping insertion in model container
[2022-04-05 03:35:58,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:35:58" (3/4) ...
[2022-04-05 03:35:58,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791cabed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 03:35:58, skipping insertion in model container
[2022-04-05 03:35:58,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 03:35:58" (4/4) ...
[2022-04-05 03:35:58,839 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound100.cJordan
[2022-04-05 03:35:58,841 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2022-04-05 03:35:58,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-05 03:35:58,869 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-05 03:35:58,874 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-04-05 03:35:58,874 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-05 03:35:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-05 03:35:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-05 03:35:58,902 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:35:58,903 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:35:58,903 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:35:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:35:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times
[2022-04-05 03:35:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:35:58,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121838987]
[2022-04-05 03:35:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:35:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:35:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-05 03:35:59,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-05 03:35:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-05 03:35:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-05 03:35:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-05 03:35:59,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-05 03:35:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-05 03:35:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:35:59,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:35:59,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121838987]
[2022-04-05 03:35:59,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121838987] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-05 03:35:59,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-05 03:35:59,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-05 03:35:59,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965252057]
[2022-04-05 03:35:59,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-05 03:35:59,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-05 03:35:59,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:35:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-05 03:35:59,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-05 03:35:59,124 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-05 03:35:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:35:59,175 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions.
[2022-04-05 03:35:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-05 03:35:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-05 03:35:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:35:59,181 INFO L225 Difference]: With dead ends: 31
[2022-04-05 03:35:59,181 INFO L226 Difference]: Without dead ends: 26
[2022-04-05 03:35:59,182 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-05 03:35:59,184 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-05 03:35:59,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-05 03:35:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2022-04-05 03:35:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25.
[2022-04-05 03:35:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-05 03:35:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions.
[2022-04-05 03:35:59,205 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22
[2022-04-05 03:35:59,205 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:35:59,205 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions.
[2022-04-05 03:35:59,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-05 03:35:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions.
[2022-04-05 03:35:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-05 03:35:59,206 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:35:59,206 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:35:59,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-05 03:35:59,207 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:35:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:35:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times
[2022-04-05 03:35:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:35:59,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899095404]
[2022-04-05 03:35:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:35:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:35:59,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:35:59,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891076315]
[2022-04-05 03:35:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:35:59,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:35:59,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:35:59,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-05 03:35:59,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-05 03:35:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-05 03:35:59,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-05 03:35:59,263 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:35:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:35:59,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-05 03:35:59,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:35:59,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899095404]
[2022-04-05 03:35:59,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:35:59,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891076315]
[2022-04-05 03:35:59,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891076315] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-05 03:35:59,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-05 03:35:59,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-05 03:35:59,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894649874]
[2022-04-05 03:35:59,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-05 03:35:59,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-05 03:35:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:35:59,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-05 03:35:59,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-05 03:35:59,342 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-05 03:35:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:35:59,350 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-05 03:35:59,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-05 03:35:59,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-05 03:35:59,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:35:59,351 INFO L225 Difference]: With dead ends: 27
[2022-04-05 03:35:59,351 INFO L226 Difference]: Without dead ends: 27
[2022-04-05 03:35:59,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-05 03:35:59,352 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-05 03:35:59,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-05 03:35:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-05 03:35:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2022-04-05 03:35:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-05 03:35:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions.
[2022-04-05 03:35:59,356 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23
[2022-04-05 03:35:59,357 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:35:59,357 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions.
[2022-04-05 03:35:59,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-05 03:35:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-05 03:35:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-05 03:35:59,358 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:35:59,358 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:35:59,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-05 03:35:59,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:35:59,583 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:35:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:35:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times
[2022-04-05 03:35:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:35:59,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980225221]
[2022-04-05 03:35:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:35:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:35:59,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:35:59,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940875749]
[2022-04-05 03:35:59,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:35:59,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:35:59,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:35:59,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-05 03:35:59,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-05 03:35:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-05 03:35:59,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core
[2022-04-05 03:35:59,639 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:35:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-04-05 03:35:59,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-05 03:35:59,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:35:59,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980225221]
[2022-04-05 03:35:59,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:35:59,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940875749]
[2022-04-05 03:35:59,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940875749] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-05 03:35:59,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-05 03:35:59,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-05 03:35:59,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170754279]
[2022-04-05 03:35:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-05 03:35:59,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-05 03:35:59,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:35:59,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-05 03:35:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2022-04-05 03:35:59,776 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-05 03:35:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:35:59,851 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions.
[2022-04-05 03:35:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-05 03:35:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23
[2022-04-05 03:35:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:35:59,853 INFO L225 Difference]: With dead ends: 35
[2022-04-05 03:35:59,853 INFO L226 Difference]: Without dead ends: 35
[2022-04-05 03:35:59,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2022-04-05 03:35:59,856 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-05 03:35:59,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 108 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-05 03:35:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2022-04-05 03:35:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32.
[2022-04-05 03:35:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-05 03:35:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions.
[2022-04-05 03:35:59,863 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23
[2022-04-05 03:35:59,864 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:35:59,864 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions.
[2022-04-05 03:35:59,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-05 03:35:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions.
[2022-04-05 03:35:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-05 03:35:59,865 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:35:59,865 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:35:59,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-05 03:36:00,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-05 03:36:00,084 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:36:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:36:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times
[2022-04-05 03:36:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:36:00,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938240087]
[2022-04-05 03:36:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:00,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:36:00,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:36:00,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901488729]
[2022-04-05 03:36:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:00,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:00,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:36:00,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-05 03:36:00,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-05 03:36:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-05 03:36:00,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-04-05 03:36:00,150 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:36:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:00,336 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-05 03:36:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:00,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:36:00,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938240087]
[2022-04-05 03:36:00,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:36:00,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901488729]
[2022-04-05 03:36:00,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901488729] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-05 03:36:00,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-05 03:36:00,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10
[2022-04-05 03:36:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026028143]
[2022-04-05 03:36:00,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-05 03:36:00,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-05 03:36:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:36:00,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-05 03:36:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2022-04-05 03:36:00,492 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-05 03:36:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:36:00,568 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions.
[2022-04-05 03:36:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-05 03:36:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29
[2022-04-05 03:36:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:36:00,570 INFO L225 Difference]: With dead ends: 37
[2022-04-05 03:36:00,570 INFO L226 Difference]: Without dead ends: 34
[2022-04-05 03:36:00,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2022-04-05 03:36:00,571 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-05 03:36:00,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 121 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-05 03:36:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2022-04-05 03:36:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29.
[2022-04-05 03:36:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-05 03:36:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions.
[2022-04-05 03:36:00,575 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29
[2022-04-05 03:36:00,576 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:36:00,576 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions.
[2022-04-05 03:36:00,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-05 03:36:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions.
[2022-04-05 03:36:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-05 03:36:00,577 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:36:00,577 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:36:00,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-04-05 03:36:00,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:00,787 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:36:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:36:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times
[2022-04-05 03:36:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:36:00,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031684972]
[2022-04-05 03:36:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:36:00,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:36:00,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237512755]
[2022-04-05 03:36:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:00,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:00,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:36:00,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-05 03:36:00,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-05 03:36:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-05 03:36:00,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-05 03:36:00,835 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:36:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:00,906 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-05 03:36:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:36:00,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031684972]
[2022-04-05 03:36:00,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:36:00,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237512755]
[2022-04-05 03:36:00,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237512755] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-05 03:36:00,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-05 03:36:00,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2022-04-05 03:36:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816968533]
[2022-04-05 03:36:00,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-05 03:36:00,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-05 03:36:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:36:00,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-05 03:36:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2022-04-05 03:36:00,962 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8)
[2022-04-05 03:36:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:36:01,014 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions.
[2022-04-05 03:36:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-05 03:36:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32
[2022-04-05 03:36:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:36:01,016 INFO L225 Difference]: With dead ends: 56
[2022-04-05 03:36:01,016 INFO L226 Difference]: Without dead ends: 56
[2022-04-05 03:36:01,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 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-04-05 03:36:01,017 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-05 03:36:01,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-05 03:36:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2022-04-05 03:36:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2022-04-05 03:36:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-05 03:36:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions.
[2022-04-05 03:36:01,023 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32
[2022-04-05 03:36:01,023 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:36:01,023 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions.
[2022-04-05 03:36:01,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8)
[2022-04-05 03:36:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions.
[2022-04-05 03:36:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2022-04-05 03:36:01,025 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:36:01,025 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:36:01,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-04-05 03:36:01,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:01,226 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:36:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:36:01,226 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times
[2022-04-05 03:36:01,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:36:01,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474246968]
[2022-04-05 03:36:01,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:36:01,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:36:01,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379554722]
[2022-04-05 03:36:01,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-05 03:36:01,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:36:01,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-05 03:36:01,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-04-05 03:36:01,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-05 03:36:01,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-05 03:36:01,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core
[2022-04-05 03:36:01,308 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:36:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:01,427 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-05 03:36:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2022-04-05 03:36:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:36:01,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474246968]
[2022-04-05 03:36:01,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:36:01,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379554722]
[2022-04-05 03:36:01,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379554722] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-05 03:36:01,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-05 03:36:01,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14
[2022-04-05 03:36:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311773025]
[2022-04-05 03:36:01,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-05 03:36:01,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-05 03:36:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:36:01,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-05 03:36:01,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182
[2022-04-05 03:36:01,557 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14)
[2022-04-05 03:36:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:36:01,670 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions.
[2022-04-05 03:36:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-04-05 03:36:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59
[2022-04-05 03:36:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:36:01,672 INFO L225 Difference]: With dead ends: 110
[2022-04-05 03:36:01,672 INFO L226 Difference]: Without dead ends: 110
[2022-04-05 03:36:01,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 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-04-05 03:36:01,673 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 107 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-05 03:36:01,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 176 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-05 03:36:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2022-04-05 03:36:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110.
[2022-04-05 03:36:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-05 03:36:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions.
[2022-04-05 03:36:01,697 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59
[2022-04-05 03:36:01,697 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:36:01,697 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions.
[2022-04-05 03:36:01,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14)
[2022-04-05 03:36:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions.
[2022-04-05 03:36:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2022-04-05 03:36:01,699 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:36:01,699 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:36:01,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2022-04-05 03:36:01,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:01,900 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:36:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:36:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times
[2022-04-05 03:36:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:36:01,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008294537]
[2022-04-05 03:36:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:01,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:36:01,911 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:36:01,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467996381]
[2022-04-05 03:36:01,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2022-04-05 03:36:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:36:01,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-05 03:36:01,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-04-05 03:36:01,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2022-04-05 03:36:01,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-05 03:36:01,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 25 conjunts are in the unsatisfiable core
[2022-04-05 03:36:01,980 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:36:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:02,214 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-05 03:36:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked.
[2022-04-05 03:36:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:36:02,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008294537]
[2022-04-05 03:36:02,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:36:02,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467996381]
[2022-04-05 03:36:02,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467996381] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-05 03:36:02,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-05 03:36:02,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26
[2022-04-05 03:36:02,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256726817]
[2022-04-05 03:36:02,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-05 03:36:02,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2022-04-05 03:36:02,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:36:02,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2022-04-05 03:36:02,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650
[2022-04-05 03:36:02,509 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26)
[2022-04-05 03:36:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:36:02,881 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions.
[2022-04-05 03:36:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2022-04-05 03:36:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113
[2022-04-05 03:36:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:36:02,883 INFO L225 Difference]: With dead ends: 218
[2022-04-05 03:36:02,883 INFO L226 Difference]: Without dead ends: 218
[2022-04-05 03:36:02,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162
[2022-04-05 03:36:02,885 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 279 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-05 03:36:02,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 290 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-05 03:36:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2022-04-05 03:36:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218.
[2022-04-05 03:36:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2022-04-05 03:36:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions.
[2022-04-05 03:36:02,893 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113
[2022-04-05 03:36:02,894 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:36:02,894 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions.
[2022-04-05 03:36:02,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26)
[2022-04-05 03:36:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions.
[2022-04-05 03:36:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2022-04-05 03:36:02,897 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:36:02,897 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:36:02,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2022-04-05 03:36:03,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:03,115 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:36:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:36:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash -698087944, now seen corresponding path program 4 times
[2022-04-05 03:36:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:36:03,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326583158]
[2022-04-05 03:36:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:36:03,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:36:03,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758701169]
[2022-04-05 03:36:03,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-05 03:36:03,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:03,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:36:03,129 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-04-05 03:36:03,130 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-04-05 03:36:03,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-05 03:36:03,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-05 03:36:03,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 49 conjunts are in the unsatisfiable core
[2022-04-05 03:36:03,237 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:36:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:03,754 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-05 03:36:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked.
[2022-04-05 03:36:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:36:04,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326583158]
[2022-04-05 03:36:04,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:36:04,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758701169]
[2022-04-05 03:36:04,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758701169] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-05 03:36:04,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-05 03:36:04,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50
[2022-04-05 03:36:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775344781]
[2022-04-05 03:36:04,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-05 03:36:04,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2022-04-05 03:36:04,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:36:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2022-04-05 03:36:04,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450
[2022-04-05 03:36:04,578 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50)
[2022-04-05 03:36:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:36:05,601 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions.
[2022-04-05 03:36:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states.
[2022-04-05 03:36:05,601 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 221
[2022-04-05 03:36:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:36:05,603 INFO L225 Difference]: With dead ends: 434
[2022-04-05 03:36:05,604 INFO L226 Difference]: Without dead ends: 434
[2022-04-05 03:36:05,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930
[2022-04-05 03:36:05,607 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 765 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-05 03:36:05,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 512 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-05 03:36:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states.
[2022-04-05 03:36:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434.
[2022-04-05 03:36:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49)
[2022-04-05 03:36:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions.
[2022-04-05 03:36:05,626 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221
[2022-04-05 03:36:05,627 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:36:05,627 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions.
[2022-04-05 03:36:05,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50)
[2022-04-05 03:36:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions.
[2022-04-05 03:36:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438
[2022-04-05 03:36:05,631 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:36:05,631 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:36:05,650 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-04-05 03:36:05,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:05,849 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:36:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:36:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash -619812232, now seen corresponding path program 5 times
[2022-04-05 03:36:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:36:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162481412]
[2022-04-05 03:36:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:36:05,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:36:05,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406239094]
[2022-04-05 03:36:05,864 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2022-04-05 03:36:05,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:05,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:36:05,865 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-04-05 03:36:05,866 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-04-05 03:36:06,202 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s)
[2022-04-05 03:36:06,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-05 03:36:06,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 97 conjunts are in the unsatisfiable core
[2022-04-05 03:36:06,214 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:36:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:07,498 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-05 03:36:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked.
[2022-04-05 03:36:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:36:09,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162481412]
[2022-04-05 03:36:09,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:36:09,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406239094]
[2022-04-05 03:36:09,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406239094] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-05 03:36:09,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-05 03:36:09,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98
[2022-04-05 03:36:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109984855]
[2022-04-05 03:36:09,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-05 03:36:09,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states
[2022-04-05 03:36:09,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:36:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants.
[2022-04-05 03:36:09,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506
[2022-04-05 03:36:09,903 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98)
[2022-04-05 03:36:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:36:13,540 INFO L93 Difference]: Finished difference Result 866 states and 961 transitions.
[2022-04-05 03:36:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states.
[2022-04-05 03:36:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98) Word has length 437
[2022-04-05 03:36:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:36:13,553 INFO L225 Difference]: With dead ends: 866
[2022-04-05 03:36:13,553 INFO L226 Difference]: Without dead ends: 866
[2022-04-05 03:36:13,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 777 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290
[2022-04-05 03:36:13,559 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 1786 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-05 03:36:13,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1786 Valid, 938 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-05 03:36:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states.
[2022-04-05 03:36:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866.
[2022-04-05 03:36:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 670 states have (on average 1.1417910447761195) internal successors, (765), 670 states have internal predecessors, (765), 99 states have call successors, (99), 98 states have call predecessors, (99), 96 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97)
[2022-04-05 03:36:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 961 transitions.
[2022-04-05 03:36:13,585 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 961 transitions. Word has length 437
[2022-04-05 03:36:13,586 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:36:13,586 INFO L478 AbstractCegarLoop]: Abstraction has 866 states and 961 transitions.
[2022-04-05 03:36:13,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 5.408163265306122) internal successors, (530), 98 states have internal predecessors, (530), 96 states have call successors, (100), 50 states have call predecessors, (100), 49 states have return successors, (98), 94 states have call predecessors, (98), 95 states have call successors, (98)
[2022-04-05 03:36:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 961 transitions.
[2022-04-05 03:36:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870
[2022-04-05 03:36:13,598 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:36:13,599 INFO L499 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:36:13,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2022-04-05 03:36:13,815 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,SelfDestructingSolverStorable8
[2022-04-05 03:36:13,815 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:36:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:36:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 151958392, now seen corresponding path program 6 times
[2022-04-05 03:36:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:36:13,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956913788]
[2022-04-05 03:36:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:36:13,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:36:13,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046023359]
[2022-04-05 03:36:13,838 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-05 03:36:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:13,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:36:13,839 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-04-05 03:36:13,840 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-04-05 03:36:14,749 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s)
[2022-04-05 03:36:14,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-05 03:36:14,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 2255 conjuncts, 193 conjunts are in the unsatisfiable core
[2022-04-05 03:36:14,772 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-05 03:36:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 39719 backedges. 188 proven. 39527 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-05 03:36:18,236 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-05 03:36:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 39719 backedges. 188 proven. 22043 refuted. 0 times theorem prover too weak. 17488 trivial. 0 not checked.
[2022-04-05 03:36:19,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-05 03:36:19,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956913788]
[2022-04-05 03:36:19,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-05 03:36:19,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046023359]
[2022-04-05 03:36:19,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046023359] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-05 03:36:19,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-05 03:36:19,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 104
[2022-04-05 03:36:19,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532689814]
[2022-04-05 03:36:19,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-05 03:36:19,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states
[2022-04-05 03:36:19,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-05 03:36:19,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants.
[2022-04-05 03:36:19,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712
[2022-04-05 03:36:19,777 INFO L87 Difference]: Start difference. First operand 866 states and 961 transitions. Second operand has 104 states, 104 states have (on average 6.75) internal successors, (702), 104 states have internal predecessors, (702), 102 states have call successors, (196), 97 states have call predecessors, (196), 96 states have return successors, (194), 100 states have call predecessors, (194), 101 states have call successors, (194)
[2022-04-05 03:36:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-05 03:36:23,546 INFO L93 Difference]: Finished difference Result 920 states and 1021 transitions.
[2022-04-05 03:36:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states.
[2022-04-05 03:36:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 6.75) internal successors, (702), 104 states have internal predecessors, (702), 102 states have call successors, (196), 97 states have call predecessors, (196), 96 states have return successors, (194), 100 states have call predecessors, (194), 101 states have call successors, (194) Word has length 869
[2022-04-05 03:36:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-05 03:36:23,552 INFO L225 Difference]: With dead ends: 920
[2022-04-05 03:36:23,552 INFO L226 Difference]: Without dead ends: 920
[2022-04-05 03:36:23,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1836 GetRequests, 1634 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006
[2022-04-05 03:36:23,556 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 1028 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2022-04-05 03:36:23,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1028 Valid, 1016 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2022-04-05 03:36:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states.
[2022-04-05 03:36:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920.
[2022-04-05 03:36:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 712 states have (on average 1.1418539325842696) internal successors, (813), 712 states have internal predecessors, (813), 105 states have call successors, (105), 104 states have call predecessors, (105), 102 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103)
[2022-04-05 03:36:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1021 transitions.
[2022-04-05 03:36:23,570 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1021 transitions. Word has length 869
[2022-04-05 03:36:23,571 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-05 03:36:23,571 INFO L478 AbstractCegarLoop]: Abstraction has 920 states and 1021 transitions.
[2022-04-05 03:36:23,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 6.75) internal successors, (702), 104 states have internal predecessors, (702), 102 states have call successors, (196), 97 states have call predecessors, (196), 96 states have return successors, (194), 100 states have call predecessors, (194), 101 states have call successors, (194)
[2022-04-05 03:36:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1021 transitions.
[2022-04-05 03:36:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924
[2022-04-05 03:36:23,587 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-05 03:36:23,588 INFO L499 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-05 03:36:23,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2022-04-05 03:36:23,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2022-04-05 03:36:23,797 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-05 03:36:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-05 03:36:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1037422744, now seen corresponding path program 7 times
[2022-04-05 03:36:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-05 03:36:23,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054901173]
[2022-04-05 03:36:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-05 03:36:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-05 03:36:23,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-05 03:36:23,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1359772185]
[2022-04-05 03:36:23,817 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2022-04-05 03:36:23,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-05 03:36:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-05 03:36:23,817 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-04-05 03:36:23,821 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-04-05 03:36:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-05 03:36:24,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-05 03:36:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-05 03:36:24,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-05 03:36:24,673 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-05 03:36:24,674 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-05 03:36:24,699 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-04-05 03:36:24,892 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,SelfDestructingSolverStorable10
[2022-04-05 03:36:24,894 INFO L719 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1]
[2022-04-05 03:36:24,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-05 03:36:25,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 03:36:25 BasicIcfg
[2022-04-05 03:36:25,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-05 03:36:25,068 INFO L158 Benchmark]: Toolchain (without parser) took 26598.37ms. Allocated memory was 235.9MB in the beginning and 379.6MB in the end (delta: 143.7MB). Free memory was 186.0MB in the beginning and 300.0MB in the end (delta: -113.9MB). Peak memory consumption was 203.2MB. Max. memory is 8.0GB.
[2022-04-05 03:36:25,068 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 235.9MB. Free memory is still 202.3MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-05 03:36:25,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.71ms. Allocated memory is still 235.9MB. Free memory was 185.8MB in the beginning and 212.2MB in the end (delta: -26.3MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB.
[2022-04-05 03:36:25,068 INFO L158 Benchmark]: Boogie Preprocessor took 16.85ms. Allocated memory is still 235.9MB. Free memory was 212.2MB in the beginning and 210.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-05 03:36:25,068 INFO L158 Benchmark]: RCFGBuilder took 179.67ms. Allocated memory is still 235.9MB. Free memory was 210.6MB in the beginning and 200.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-05 03:36:25,068 INFO L158 Benchmark]: IcfgTransformer took 14.42ms. Allocated memory is still 235.9MB. Free memory was 200.1MB in the beginning and 198.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-05 03:36:25,069 INFO L158 Benchmark]: TraceAbstraction took 26232.53ms. Allocated memory was 235.9MB in the beginning and 379.6MB in the end (delta: 143.7MB). Free memory was 198.0MB in the beginning and 300.0MB in the end (delta: -102.0MB). Peak memory consumption was 215.8MB. Max. memory is 8.0GB.
[2022-04-05 03:36:25,069 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.09ms. Allocated memory is still 235.9MB. Free memory is still 202.3MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 150.71ms. Allocated memory is still 235.9MB. Free memory was 185.8MB in the beginning and 212.2MB in the end (delta: -26.3MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 16.85ms. Allocated memory is still 235.9MB. Free memory was 212.2MB in the beginning and 210.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 179.67ms. Allocated memory is still 235.9MB. Free memory was 210.6MB in the beginning and 200.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* IcfgTransformer took 14.42ms. Allocated memory is still 235.9MB. Free memory was 200.1MB in the beginning and 198.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* TraceAbstraction took 26232.53ms. Allocated memory was 235.9MB in the beginning and 379.6MB in the end (delta: 143.7MB). Free memory was 198.0MB in the beginning and 300.0MB in the end (delta: -102.0MB). Peak memory consumption was 215.8MB. 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: 18]: 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)=102, counter=0]
[L24] int x1, x2;
[L25] int y1, y2, y3;
[L26] x1 = __VERIFIER_nondet_int()
[L27] x2 = __VERIFIER_nondet_int()
[L29] CALL assume_abort_if_not(x1 >= 0)
VAL [\old(cond)=1, \old(counter)=0, counter=0]
[L13] COND FALSE !(!cond)
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0]
[L29] RET assume_abort_if_not(x1 >= 0)
VAL [\old(counter)=0, counter=0, x1=101, x2=1]
[L30] CALL assume_abort_if_not(x2 != 0)
VAL [\old(cond)=1, \old(counter)=0, counter=0]
[L13] COND FALSE !(!cond)
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0]
[L30] RET assume_abort_if_not(x2 != 0)
VAL [\old(counter)=0, counter=0, x1=101, x2=1]
[L32] y1 = 0
[L33] y2 = 0
[L34] y3 = x1
VAL [\old(counter)=0, counter=0, x1=101, x2=1, y1=0, y2=0, y3=101]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=1, counter++=0, x1=101, x2=1, y1=0, y2=0, y3=101]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=1]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=1, x1=101, x2=1, y1=0, y2=0, y3=101]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=1, x1=101, x2=1, y1=0, y2=0, y3=101]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=1, x1=101, x2=1, y1=1, y2=0, y3=100]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=2, counter++=1, x1=101, x2=1, y1=1, y2=0, y3=100]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=2]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=2, x1=101, x2=1, y1=1, y2=0, y3=100]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=2, x1=101, x2=1, y1=1, y2=0, y3=100]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=2, x1=101, x2=1, y1=2, y2=0, y3=99]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=3, counter++=2, x1=101, x2=1, y1=2, y2=0, y3=99]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=3]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=3, x1=101, x2=1, y1=2, y2=0, y3=99]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=3, x1=101, x2=1, y1=2, y2=0, y3=99]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=3, x1=101, x2=1, y1=3, y2=0, y3=98]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=4, counter++=3, x1=101, x2=1, y1=3, y2=0, y3=98]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=4]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=4, x1=101, x2=1, y1=3, y2=0, y3=98]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=4, x1=101, x2=1, y1=3, y2=0, y3=98]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=4, x1=101, x2=1, y1=4, y2=0, y3=97]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=5, counter++=4, x1=101, x2=1, y1=4, y2=0, y3=97]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=5]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=5, x1=101, x2=1, y1=4, y2=0, y3=97]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=5, x1=101, x2=1, y1=4, y2=0, y3=97]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=5, x1=101, x2=1, y1=5, y2=0, y3=96]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=6, counter++=5, x1=101, x2=1, y1=5, y2=0, y3=96]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=6]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=6, x1=101, x2=1, y1=5, y2=0, y3=96]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=6, x1=101, x2=1, y1=5, y2=0, y3=96]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=6, x1=101, x2=1, y1=6, y2=0, y3=95]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=7, counter++=6, x1=101, x2=1, y1=6, y2=0, y3=95]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=7]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=7, x1=101, x2=1, y1=6, y2=0, y3=95]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=7, x1=101, x2=1, y1=6, y2=0, y3=95]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=7, x1=101, x2=1, y1=7, y2=0, y3=94]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=8, counter++=7, x1=101, x2=1, y1=7, y2=0, y3=94]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=8]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=8, x1=101, x2=1, y1=7, y2=0, y3=94]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=8, x1=101, x2=1, y1=7, y2=0, y3=94]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=8, x1=101, x2=1, y1=8, y2=0, y3=93]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=9, counter++=8, x1=101, x2=1, y1=8, y2=0, y3=93]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=9]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=9, x1=101, x2=1, y1=8, y2=0, y3=93]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=9, x1=101, x2=1, y1=8, y2=0, y3=93]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=9, x1=101, x2=1, y1=9, y2=0, y3=92]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=10, counter++=9, x1=101, x2=1, y1=9, y2=0, y3=92]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=10]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=10, x1=101, x2=1, y1=9, y2=0, y3=92]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=10, x1=101, x2=1, y1=9, y2=0, y3=92]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=10, x1=101, x2=1, y1=10, y2=0, y3=91]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=11, counter++=10, x1=101, x2=1, y1=10, y2=0, y3=91]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=11]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=11, x1=101, x2=1, y1=10, y2=0, y3=91]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=11, x1=101, x2=1, y1=10, y2=0, y3=91]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=11, x1=101, x2=1, y1=11, y2=0, y3=90]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=12, counter++=11, x1=101, x2=1, y1=11, y2=0, y3=90]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=12]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=12, x1=101, x2=1, y1=11, y2=0, y3=90]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=12, x1=101, x2=1, y1=11, y2=0, y3=90]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=12, x1=101, x2=1, y1=12, y2=0, y3=89]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=13, counter++=12, x1=101, x2=1, y1=12, y2=0, y3=89]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=13]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=13, x1=101, x2=1, y1=12, y2=0, y3=89]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=13, x1=101, x2=1, y1=12, y2=0, y3=89]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=13, x1=101, x2=1, y1=13, y2=0, y3=88]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=14, counter++=13, x1=101, x2=1, y1=13, y2=0, y3=88]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=14]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=14, x1=101, x2=1, y1=13, y2=0, y3=88]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=14, x1=101, x2=1, y1=13, y2=0, y3=88]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=14, x1=101, x2=1, y1=14, y2=0, y3=87]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=15, counter++=14, x1=101, x2=1, y1=14, y2=0, y3=87]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=15]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=15, x1=101, x2=1, y1=14, y2=0, y3=87]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=15, x1=101, x2=1, y1=14, y2=0, y3=87]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=15, x1=101, x2=1, y1=15, y2=0, y3=86]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=16, counter++=15, x1=101, x2=1, y1=15, y2=0, y3=86]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=16]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=16, x1=101, x2=1, y1=15, y2=0, y3=86]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=16, x1=101, x2=1, y1=15, y2=0, y3=86]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=16, x1=101, x2=1, y1=16, y2=0, y3=85]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=17, counter++=16, x1=101, x2=1, y1=16, y2=0, y3=85]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=17]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=17, x1=101, x2=1, y1=16, y2=0, y3=85]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=17, x1=101, x2=1, y1=16, y2=0, y3=85]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=17, x1=101, x2=1, y1=17, y2=0, y3=84]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=18, counter++=17, x1=101, x2=1, y1=17, y2=0, y3=84]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=18]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=18, x1=101, x2=1, y1=17, y2=0, y3=84]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=18, x1=101, x2=1, y1=17, y2=0, y3=84]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=18, x1=101, x2=1, y1=18, y2=0, y3=83]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=19, counter++=18, x1=101, x2=1, y1=18, y2=0, y3=83]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=19]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=19, x1=101, x2=1, y1=18, y2=0, y3=83]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=19, x1=101, x2=1, y1=18, y2=0, y3=83]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=19, x1=101, x2=1, y1=19, y2=0, y3=82]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=20, counter++=19, x1=101, x2=1, y1=19, y2=0, y3=82]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=20]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=20, x1=101, x2=1, y1=19, y2=0, y3=82]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=20, x1=101, x2=1, y1=19, y2=0, y3=82]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=20, x1=101, x2=1, y1=20, y2=0, y3=81]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=21, counter++=20, x1=101, x2=1, y1=20, y2=0, y3=81]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=21]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=21, x1=101, x2=1, y1=20, y2=0, y3=81]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=21, x1=101, x2=1, y1=20, y2=0, y3=81]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=21, x1=101, x2=1, y1=21, y2=0, y3=80]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=22, counter++=21, x1=101, x2=1, y1=21, y2=0, y3=80]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=22]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=22, x1=101, x2=1, y1=21, y2=0, y3=80]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=22, x1=101, x2=1, y1=21, y2=0, y3=80]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=22, x1=101, x2=1, y1=22, y2=0, y3=79]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=23, counter++=22, x1=101, x2=1, y1=22, y2=0, y3=79]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=23]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=23, x1=101, x2=1, y1=22, y2=0, y3=79]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=23, x1=101, x2=1, y1=22, y2=0, y3=79]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=23, x1=101, x2=1, y1=23, y2=0, y3=78]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=24, counter++=23, x1=101, x2=1, y1=23, y2=0, y3=78]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=24]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=24, x1=101, x2=1, y1=23, y2=0, y3=78]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=24, x1=101, x2=1, y1=23, y2=0, y3=78]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=24, x1=101, x2=1, y1=24, y2=0, y3=77]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=25, counter++=24, x1=101, x2=1, y1=24, y2=0, y3=77]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=25]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=25, x1=101, x2=1, y1=24, y2=0, y3=77]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=25, x1=101, x2=1, y1=24, y2=0, y3=77]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=25, x1=101, x2=1, y1=25, y2=0, y3=76]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=26, counter++=25, x1=101, x2=1, y1=25, y2=0, y3=76]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=26]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=26, x1=101, x2=1, y1=25, y2=0, y3=76]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=26, x1=101, x2=1, y1=25, y2=0, y3=76]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=26, x1=101, x2=1, y1=26, y2=0, y3=75]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=27, counter++=26, x1=101, x2=1, y1=26, y2=0, y3=75]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=27]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=27, x1=101, x2=1, y1=26, y2=0, y3=75]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=27, x1=101, x2=1, y1=26, y2=0, y3=75]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=27, x1=101, x2=1, y1=27, y2=0, y3=74]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=28, counter++=27, x1=101, x2=1, y1=27, y2=0, y3=74]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=28]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=28, x1=101, x2=1, y1=27, y2=0, y3=74]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=28, x1=101, x2=1, y1=27, y2=0, y3=74]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=28, x1=101, x2=1, y1=28, y2=0, y3=73]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=29, counter++=28, x1=101, x2=1, y1=28, y2=0, y3=73]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=29]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=29, x1=101, x2=1, y1=28, y2=0, y3=73]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=29, x1=101, x2=1, y1=28, y2=0, y3=73]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=29, x1=101, x2=1, y1=29, y2=0, y3=72]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=30, counter++=29, x1=101, x2=1, y1=29, y2=0, y3=72]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=30]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=30, x1=101, x2=1, y1=29, y2=0, y3=72]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=30, x1=101, x2=1, y1=29, y2=0, y3=72]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=30, x1=101, x2=1, y1=30, y2=0, y3=71]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=31, counter++=30, x1=101, x2=1, y1=30, y2=0, y3=71]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=31]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=31, x1=101, x2=1, y1=30, y2=0, y3=71]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=31, x1=101, x2=1, y1=30, y2=0, y3=71]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=31, x1=101, x2=1, y1=31, y2=0, y3=70]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=32, counter++=31, x1=101, x2=1, y1=31, y2=0, y3=70]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=32]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=32, x1=101, x2=1, y1=31, y2=0, y3=70]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=32, x1=101, x2=1, y1=31, y2=0, y3=70]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=32, x1=101, x2=1, y1=32, y2=0, y3=69]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=33, counter++=32, x1=101, x2=1, y1=32, y2=0, y3=69]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=33]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=33, x1=101, x2=1, y1=32, y2=0, y3=69]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=33, x1=101, x2=1, y1=32, y2=0, y3=69]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=33, x1=101, x2=1, y1=33, y2=0, y3=68]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=34, counter++=33, x1=101, x2=1, y1=33, y2=0, y3=68]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=34]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=34, x1=101, x2=1, y1=33, y2=0, y3=68]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=34, x1=101, x2=1, y1=33, y2=0, y3=68]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=34, x1=101, x2=1, y1=34, y2=0, y3=67]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=35, counter++=34, x1=101, x2=1, y1=34, y2=0, y3=67]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=35]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=35, x1=101, x2=1, y1=34, y2=0, y3=67]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=35, x1=101, x2=1, y1=34, y2=0, y3=67]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=35, x1=101, x2=1, y1=35, y2=0, y3=66]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=36, counter++=35, x1=101, x2=1, y1=35, y2=0, y3=66]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=36]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=36, x1=101, x2=1, y1=35, y2=0, y3=66]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=36, x1=101, x2=1, y1=35, y2=0, y3=66]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=36, x1=101, x2=1, y1=36, y2=0, y3=65]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=37, counter++=36, x1=101, x2=1, y1=36, y2=0, y3=65]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=37]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=37, x1=101, x2=1, y1=36, y2=0, y3=65]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=37, x1=101, x2=1, y1=36, y2=0, y3=65]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=37, x1=101, x2=1, y1=37, y2=0, y3=64]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=38, counter++=37, x1=101, x2=1, y1=37, y2=0, y3=64]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=38]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=38, x1=101, x2=1, y1=37, y2=0, y3=64]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=38, x1=101, x2=1, y1=37, y2=0, y3=64]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=38, x1=101, x2=1, y1=38, y2=0, y3=63]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=39, counter++=38, x1=101, x2=1, y1=38, y2=0, y3=63]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=39]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=39, x1=101, x2=1, y1=38, y2=0, y3=63]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=39, x1=101, x2=1, y1=38, y2=0, y3=63]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=39, x1=101, x2=1, y1=39, y2=0, y3=62]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=40, counter++=39, x1=101, x2=1, y1=39, y2=0, y3=62]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=40]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=40, x1=101, x2=1, y1=39, y2=0, y3=62]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=40, x1=101, x2=1, y1=39, y2=0, y3=62]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=40, x1=101, x2=1, y1=40, y2=0, y3=61]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=41, counter++=40, x1=101, x2=1, y1=40, y2=0, y3=61]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=41]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=41, x1=101, x2=1, y1=40, y2=0, y3=61]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=41, x1=101, x2=1, y1=40, y2=0, y3=61]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=41, x1=101, x2=1, y1=41, y2=0, y3=60]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=42, counter++=41, x1=101, x2=1, y1=41, y2=0, y3=60]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=42]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=42, x1=101, x2=1, y1=41, y2=0, y3=60]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=42, x1=101, x2=1, y1=41, y2=0, y3=60]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=42, x1=101, x2=1, y1=42, y2=0, y3=59]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=43, counter++=42, x1=101, x2=1, y1=42, y2=0, y3=59]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=43]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=43, x1=101, x2=1, y1=42, y2=0, y3=59]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=43, x1=101, x2=1, y1=42, y2=0, y3=59]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=43, x1=101, x2=1, y1=43, y2=0, y3=58]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=44, counter++=43, x1=101, x2=1, y1=43, y2=0, y3=58]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=44]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=44, x1=101, x2=1, y1=43, y2=0, y3=58]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=44, x1=101, x2=1, y1=43, y2=0, y3=58]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=44, x1=101, x2=1, y1=44, y2=0, y3=57]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=45, counter++=44, x1=101, x2=1, y1=44, y2=0, y3=57]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=45]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=45, x1=101, x2=1, y1=44, y2=0, y3=57]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=45, x1=101, x2=1, y1=44, y2=0, y3=57]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=45, x1=101, x2=1, y1=45, y2=0, y3=56]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=46, counter++=45, x1=101, x2=1, y1=45, y2=0, y3=56]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=46]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=46, x1=101, x2=1, y1=45, y2=0, y3=56]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=46, x1=101, x2=1, y1=45, y2=0, y3=56]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=46, x1=101, x2=1, y1=46, y2=0, y3=55]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=47, counter++=46, x1=101, x2=1, y1=46, y2=0, y3=55]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=47]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=47, x1=101, x2=1, y1=46, y2=0, y3=55]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=47, x1=101, x2=1, y1=46, y2=0, y3=55]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=47, x1=101, x2=1, y1=47, y2=0, y3=54]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=48, counter++=47, x1=101, x2=1, y1=47, y2=0, y3=54]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=48]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=48, x1=101, x2=1, y1=47, y2=0, y3=54]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=48, x1=101, x2=1, y1=47, y2=0, y3=54]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=48, x1=101, x2=1, y1=48, y2=0, y3=53]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=49, counter++=48, x1=101, x2=1, y1=48, y2=0, y3=53]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=49]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=49, x1=101, x2=1, y1=48, y2=0, y3=53]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=49, x1=101, x2=1, y1=48, y2=0, y3=53]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=49, x1=101, x2=1, y1=49, y2=0, y3=52]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=50, counter++=49, x1=101, x2=1, y1=49, y2=0, y3=52]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=50]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=50, x1=101, x2=1, y1=49, y2=0, y3=52]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=50, x1=101, x2=1, y1=49, y2=0, y3=52]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=50, x1=101, x2=1, y1=50, y2=0, y3=51]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=51, counter++=50, x1=101, x2=1, y1=50, y2=0, y3=51]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=51]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=51]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=51, x1=101, x2=1, y1=50, y2=0, y3=51]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=51, x1=101, x2=1, y1=50, y2=0, y3=51]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=51, x1=101, x2=1, y1=51, y2=0, y3=50]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=52, counter++=51, x1=101, x2=1, y1=51, y2=0, y3=50]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=52]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=52]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=52, x1=101, x2=1, y1=51, y2=0, y3=50]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=52, x1=101, x2=1, y1=51, y2=0, y3=50]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=52, x1=101, x2=1, y1=52, y2=0, y3=49]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=53, counter++=52, x1=101, x2=1, y1=52, y2=0, y3=49]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=53]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=53, x1=101, x2=1, y1=52, y2=0, y3=49]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=53, x1=101, x2=1, y1=52, y2=0, y3=49]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=53, x1=101, x2=1, y1=53, y2=0, y3=48]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=54, counter++=53, x1=101, x2=1, y1=53, y2=0, y3=48]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=54]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=54]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=54, x1=101, x2=1, y1=53, y2=0, y3=48]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=54, x1=101, x2=1, y1=53, y2=0, y3=48]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=54, x1=101, x2=1, y1=54, y2=0, y3=47]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=55, counter++=54, x1=101, x2=1, y1=54, y2=0, y3=47]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=55]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=55]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=55, x1=101, x2=1, y1=54, y2=0, y3=47]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=55, x1=101, x2=1, y1=54, y2=0, y3=47]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=55, x1=101, x2=1, y1=55, y2=0, y3=46]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=56, counter++=55, x1=101, x2=1, y1=55, y2=0, y3=46]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=56]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=56]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=56, x1=101, x2=1, y1=55, y2=0, y3=46]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=56, x1=101, x2=1, y1=55, y2=0, y3=46]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=56, x1=101, x2=1, y1=56, y2=0, y3=45]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=57, counter++=56, x1=101, x2=1, y1=56, y2=0, y3=45]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=57]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=57, x1=101, x2=1, y1=56, y2=0, y3=45]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=57, x1=101, x2=1, y1=56, y2=0, y3=45]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=57, x1=101, x2=1, y1=57, y2=0, y3=44]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=58, counter++=57, x1=101, x2=1, y1=57, y2=0, y3=44]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=58]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=58]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=58, x1=101, x2=1, y1=57, y2=0, y3=44]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=58, x1=101, x2=1, y1=57, y2=0, y3=44]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=58, x1=101, x2=1, y1=58, y2=0, y3=43]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=59, counter++=58, x1=101, x2=1, y1=58, y2=0, y3=43]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=59]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=59]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=59, x1=101, x2=1, y1=58, y2=0, y3=43]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=59, x1=101, x2=1, y1=58, y2=0, y3=43]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=59, x1=101, x2=1, y1=59, y2=0, y3=42]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=60, counter++=59, x1=101, x2=1, y1=59, y2=0, y3=42]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=60]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=60]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=60, x1=101, x2=1, y1=59, y2=0, y3=42]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=60, x1=101, x2=1, y1=59, y2=0, y3=42]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=60, x1=101, x2=1, y1=60, y2=0, y3=41]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=61, counter++=60, x1=101, x2=1, y1=60, y2=0, y3=41]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=61]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=61, x1=101, x2=1, y1=60, y2=0, y3=41]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=61, x1=101, x2=1, y1=60, y2=0, y3=41]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=61, x1=101, x2=1, y1=61, y2=0, y3=40]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=62, counter++=61, x1=101, x2=1, y1=61, y2=0, y3=40]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=62]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=62]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=62, x1=101, x2=1, y1=61, y2=0, y3=40]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=62, x1=101, x2=1, y1=61, y2=0, y3=40]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=62, x1=101, x2=1, y1=62, y2=0, y3=39]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=63, counter++=62, x1=101, x2=1, y1=62, y2=0, y3=39]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=63]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=63]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=63, x1=101, x2=1, y1=62, y2=0, y3=39]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=63, x1=101, x2=1, y1=62, y2=0, y3=39]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=63, x1=101, x2=1, y1=63, y2=0, y3=38]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=64, counter++=63, x1=101, x2=1, y1=63, y2=0, y3=38]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=64]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=64]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=64, x1=101, x2=1, y1=63, y2=0, y3=38]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=64, x1=101, x2=1, y1=63, y2=0, y3=38]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=64, x1=101, x2=1, y1=64, y2=0, y3=37]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=65, counter++=64, x1=101, x2=1, y1=64, y2=0, y3=37]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=65]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=65, x1=101, x2=1, y1=64, y2=0, y3=37]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=65, x1=101, x2=1, y1=64, y2=0, y3=37]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=65, x1=101, x2=1, y1=65, y2=0, y3=36]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=66, counter++=65, x1=101, x2=1, y1=65, y2=0, y3=36]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=66]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=66]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=66, x1=101, x2=1, y1=65, y2=0, y3=36]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=66, x1=101, x2=1, y1=65, y2=0, y3=36]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=66, x1=101, x2=1, y1=66, y2=0, y3=35]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=67, counter++=66, x1=101, x2=1, y1=66, y2=0, y3=35]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=67]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=67]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=67, x1=101, x2=1, y1=66, y2=0, y3=35]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=67, x1=101, x2=1, y1=66, y2=0, y3=35]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=67, x1=101, x2=1, y1=67, y2=0, y3=34]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=68, counter++=67, x1=101, x2=1, y1=67, y2=0, y3=34]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=68]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=68]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=68, x1=101, x2=1, y1=67, y2=0, y3=34]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=68, x1=101, x2=1, y1=67, y2=0, y3=34]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=68, x1=101, x2=1, y1=68, y2=0, y3=33]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=69, counter++=68, x1=101, x2=1, y1=68, y2=0, y3=33]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=69]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=69, x1=101, x2=1, y1=68, y2=0, y3=33]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=69, x1=101, x2=1, y1=68, y2=0, y3=33]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=69, x1=101, x2=1, y1=69, y2=0, y3=32]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=70, counter++=69, x1=101, x2=1, y1=69, y2=0, y3=32]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=70]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=70]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=70, x1=101, x2=1, y1=69, y2=0, y3=32]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=70, x1=101, x2=1, y1=69, y2=0, y3=32]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=70, x1=101, x2=1, y1=70, y2=0, y3=31]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=71, counter++=70, x1=101, x2=1, y1=70, y2=0, y3=31]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=71]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=71]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=71, x1=101, x2=1, y1=70, y2=0, y3=31]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=71, x1=101, x2=1, y1=70, y2=0, y3=31]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=71, x1=101, x2=1, y1=71, y2=0, y3=30]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=72, counter++=71, x1=101, x2=1, y1=71, y2=0, y3=30]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=72]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=72]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=72, x1=101, x2=1, y1=71, y2=0, y3=30]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=72, x1=101, x2=1, y1=71, y2=0, y3=30]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=72, x1=101, x2=1, y1=72, y2=0, y3=29]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=73, counter++=72, x1=101, x2=1, y1=72, y2=0, y3=29]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=73]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=73, x1=101, x2=1, y1=72, y2=0, y3=29]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=73, x1=101, x2=1, y1=72, y2=0, y3=29]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=73, x1=101, x2=1, y1=73, y2=0, y3=28]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=74, counter++=73, x1=101, x2=1, y1=73, y2=0, y3=28]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=74]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=74]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=74, x1=101, x2=1, y1=73, y2=0, y3=28]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=74, x1=101, x2=1, y1=73, y2=0, y3=28]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=74, x1=101, x2=1, y1=74, y2=0, y3=27]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=75, counter++=74, x1=101, x2=1, y1=74, y2=0, y3=27]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=75]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=75]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=75, x1=101, x2=1, y1=74, y2=0, y3=27]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=75, x1=101, x2=1, y1=74, y2=0, y3=27]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=75, x1=101, x2=1, y1=75, y2=0, y3=26]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=76, counter++=75, x1=101, x2=1, y1=75, y2=0, y3=26]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=76]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=76]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=76, x1=101, x2=1, y1=75, y2=0, y3=26]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=76, x1=101, x2=1, y1=75, y2=0, y3=26]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=76, x1=101, x2=1, y1=76, y2=0, y3=25]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=77, counter++=76, x1=101, x2=1, y1=76, y2=0, y3=25]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=77]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=77, x1=101, x2=1, y1=76, y2=0, y3=25]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=77, x1=101, x2=1, y1=76, y2=0, y3=25]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=77, x1=101, x2=1, y1=77, y2=0, y3=24]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=78, counter++=77, x1=101, x2=1, y1=77, y2=0, y3=24]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=78]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=78]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=78, x1=101, x2=1, y1=77, y2=0, y3=24]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=78, x1=101, x2=1, y1=77, y2=0, y3=24]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=78, x1=101, x2=1, y1=78, y2=0, y3=23]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=79, counter++=78, x1=101, x2=1, y1=78, y2=0, y3=23]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=79]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=79]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=79, x1=101, x2=1, y1=78, y2=0, y3=23]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=79, x1=101, x2=1, y1=78, y2=0, y3=23]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=79, x1=101, x2=1, y1=79, y2=0, y3=22]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=80, counter++=79, x1=101, x2=1, y1=79, y2=0, y3=22]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=80]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=80]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=80, x1=101, x2=1, y1=79, y2=0, y3=22]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=80, x1=101, x2=1, y1=79, y2=0, y3=22]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=80, x1=101, x2=1, y1=80, y2=0, y3=21]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=81, counter++=80, x1=101, x2=1, y1=80, y2=0, y3=21]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=81]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=81, x1=101, x2=1, y1=80, y2=0, y3=21]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=81, x1=101, x2=1, y1=80, y2=0, y3=21]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=81, x1=101, x2=1, y1=81, y2=0, y3=20]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=82, counter++=81, x1=101, x2=1, y1=81, y2=0, y3=20]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=82]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=82]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=82, x1=101, x2=1, y1=81, y2=0, y3=20]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=82, x1=101, x2=1, y1=81, y2=0, y3=20]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=82, x1=101, x2=1, y1=82, y2=0, y3=19]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=83, counter++=82, x1=101, x2=1, y1=82, y2=0, y3=19]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=83]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=83]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=83, x1=101, x2=1, y1=82, y2=0, y3=19]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=83, x1=101, x2=1, y1=82, y2=0, y3=19]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=83, x1=101, x2=1, y1=83, y2=0, y3=18]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=84, counter++=83, x1=101, x2=1, y1=83, y2=0, y3=18]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=84]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=84]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=84, x1=101, x2=1, y1=83, y2=0, y3=18]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=84, x1=101, x2=1, y1=83, y2=0, y3=18]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=84, x1=101, x2=1, y1=84, y2=0, y3=17]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=85, counter++=84, x1=101, x2=1, y1=84, y2=0, y3=17]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=85]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=85, x1=101, x2=1, y1=84, y2=0, y3=17]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=85, x1=101, x2=1, y1=84, y2=0, y3=17]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=85, x1=101, x2=1, y1=85, y2=0, y3=16]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=86, counter++=85, x1=101, x2=1, y1=85, y2=0, y3=16]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=86]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=86]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=86, x1=101, x2=1, y1=85, y2=0, y3=16]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=86, x1=101, x2=1, y1=85, y2=0, y3=16]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=86, x1=101, x2=1, y1=86, y2=0, y3=15]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=87, counter++=86, x1=101, x2=1, y1=86, y2=0, y3=15]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=87]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=87]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=87, x1=101, x2=1, y1=86, y2=0, y3=15]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=87, x1=101, x2=1, y1=86, y2=0, y3=15]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=87, x1=101, x2=1, y1=87, y2=0, y3=14]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=88, counter++=87, x1=101, x2=1, y1=87, y2=0, y3=14]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=88]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=88]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=88, x1=101, x2=1, y1=87, y2=0, y3=14]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=88, x1=101, x2=1, y1=87, y2=0, y3=14]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=88, x1=101, x2=1, y1=88, y2=0, y3=13]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=89, counter++=88, x1=101, x2=1, y1=88, y2=0, y3=13]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=89]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=89, x1=101, x2=1, y1=88, y2=0, y3=13]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=89, x1=101, x2=1, y1=88, y2=0, y3=13]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=89, x1=101, x2=1, y1=89, y2=0, y3=12]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=90, counter++=89, x1=101, x2=1, y1=89, y2=0, y3=12]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=90]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=90]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=90, x1=101, x2=1, y1=89, y2=0, y3=12]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=90, x1=101, x2=1, y1=89, y2=0, y3=12]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=90, x1=101, x2=1, y1=90, y2=0, y3=11]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=91, counter++=90, x1=101, x2=1, y1=90, y2=0, y3=11]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=91]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=91]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=91, x1=101, x2=1, y1=90, y2=0, y3=11]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=91, x1=101, x2=1, y1=90, y2=0, y3=11]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=91, x1=101, x2=1, y1=91, y2=0, y3=10]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=92, counter++=91, x1=101, x2=1, y1=91, y2=0, y3=10]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=92]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=92]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=92, x1=101, x2=1, y1=91, y2=0, y3=10]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=92, x1=101, x2=1, y1=91, y2=0, y3=10]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=92, x1=101, x2=1, y1=92, y2=0, y3=9]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=93, counter++=92, x1=101, x2=1, y1=92, y2=0, y3=9]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=93]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=93, x1=101, x2=1, y1=92, y2=0, y3=9]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=93, x1=101, x2=1, y1=92, y2=0, y3=9]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=93, x1=101, x2=1, y1=93, y2=0, y3=8]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=94, counter++=93, x1=101, x2=1, y1=93, y2=0, y3=8]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=94]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=94]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=94, x1=101, x2=1, y1=93, y2=0, y3=8]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=94, x1=101, x2=1, y1=93, y2=0, y3=8]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=94, x1=101, x2=1, y1=94, y2=0, y3=7]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=95, counter++=94, x1=101, x2=1, y1=94, y2=0, y3=7]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=95]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=95]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=95, x1=101, x2=1, y1=94, y2=0, y3=7]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=95, x1=101, x2=1, y1=94, y2=0, y3=7]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=95, x1=101, x2=1, y1=95, y2=0, y3=6]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=96, counter++=95, x1=101, x2=1, y1=95, y2=0, y3=6]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=96]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=96]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=96, x1=101, x2=1, y1=95, y2=0, y3=6]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=96, x1=101, x2=1, y1=95, y2=0, y3=6]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=96, x1=101, x2=1, y1=96, y2=0, y3=5]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=97, counter++=96, x1=101, x2=1, y1=96, y2=0, y3=5]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=97]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=97, x1=101, x2=1, y1=96, y2=0, y3=5]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=97, x1=101, x2=1, y1=96, y2=0, y3=5]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=97, x1=101, x2=1, y1=97, y2=0, y3=4]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=98, counter++=97, x1=101, x2=1, y1=97, y2=0, y3=4]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=98]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=98]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=98, x1=101, x2=1, y1=97, y2=0, y3=4]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=98, x1=101, x2=1, y1=97, y2=0, y3=4]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=98, x1=101, x2=1, y1=98, y2=0, y3=3]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=99, counter++=98, x1=101, x2=1, y1=98, y2=0, y3=3]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=99]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=99]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=99, x1=101, x2=1, y1=98, y2=0, y3=3]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=99, x1=101, x2=1, y1=98, y2=0, y3=3]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=99, x1=101, x2=1, y1=99, y2=0, y3=2]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=100, counter++=99, x1=101, x2=1, y1=99, y2=0, y3=2]
[L36] COND TRUE counter++<100
[L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(cond)=1, \old(counter)=0, counter=100]
[L16] COND FALSE !(!(cond))
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=100]
[L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1)
VAL [\old(counter)=0, counter=100, x1=101, x2=1, y1=99, y2=0, y3=2]
[L39] COND FALSE !(!(y3 != 0))
VAL [\old(counter)=0, counter=100, x1=101, x2=1, y1=99, y2=0, y3=2]
[L41] COND TRUE y2 + 1 == x2
[L42] y1 = y1 + 1
[L43] y2 = 0
[L44] y3 = y3 - 1
VAL [\old(counter)=0, counter=100, x1=101, x2=1, y1=100, y2=0, y3=1]
[L36] EXPR counter++
VAL [\old(counter)=0, counter=101, counter++=100, x1=101, x2=1, y1=100, y2=0, y3=1]
[L36] COND FALSE !(counter++<100)
[L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1)
VAL [\old(cond)=0, \old(counter)=0, counter=101]
[L16] COND TRUE !(cond)
VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=101]
[L18] reach_error()
VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=101]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4044 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4040 mSDsluCounter, 3369 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2844 mSDsCounter, 1184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2032 IncrementalHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1184 mSolverCounterUnsat, 525 mSDtfsCounter, 2032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3842 GetRequests, 3260 SyntacticMatches, 2 SemanticMatches, 580 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12158 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=920occurred in iteration=10, InterpolantAutomatonStates: 587, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2751 NumberOfCodeBlocks, 2751 NumberOfCodeBlocksAsserted, 163 NumberOfCheckSat, 3571 ConstructedInterpolants, 0 QuantifiedInterpolants, 8995 SizeOfPredicates, 194 NumberOfNonLiveVariables, 4919 ConjunctsInSsa, 413 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 23530/103872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-04-05 03:36:25,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...