/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-dev-a10ec3b
[2022-01-10 17:48:21,563 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-01-10 17:48:21,565 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-01-10 17:48:21,585 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-01-10 17:48:21,586 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-01-10 17:48:21,588 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-01-10 17:48:21,589 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-01-10 17:48:21,590 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-01-10 17:48:21,591 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-01-10 17:48:21,592 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-01-10 17:48:21,592 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-01-10 17:48:21,593 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-01-10 17:48:21,593 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-01-10 17:48:21,594 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-01-10 17:48:21,595 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-01-10 17:48:21,595 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-01-10 17:48:21,596 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-01-10 17:48:21,596 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-01-10 17:48:21,598 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-01-10 17:48:21,599 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-01-10 17:48:21,600 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-01-10 17:48:21,611 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-01-10 17:48:21,612 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-01-10 17:48:21,612 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-01-10 17:48:21,614 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-01-10 17:48:21,614 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-01-10 17:48:21,614 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-01-10 17:48:21,615 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-01-10 17:48:21,615 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-01-10 17:48:21,616 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-01-10 17:48:21,616 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-01-10 17:48:21,616 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-01-10 17:48:21,617 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-01-10 17:48:21,617 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-01-10 17:48:21,618 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-01-10 17:48:21,618 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-01-10 17:48:21,619 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-01-10 17:48:21,619 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-01-10 17:48:21,619 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-01-10 17:48:21,620 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-01-10 17:48:21,620 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-01-10 17:48:21,625 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf
[2022-01-10 17:48:21,646 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-01-10 17:48:21,647 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-01-10 17:48:21,647 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-01-10 17:48:21,678 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-01-10 17:48:21,679 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-01-10 17:48:21,679 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-01-10 17:48:21,679 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-01-10 17:48:21,679 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-01-10 17:48:21,679 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-01-10 17:48:21,679 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-01-10 17:48:21,679 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-01-10 17:48:21,680 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-01-10 17:48:21,680 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-01-10 17:48:21,681 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2022-01-10 17:48:21,681 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2022-01-10 17:48:21,683 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-01-10 17:48:21,683 INFO  L138        SettingsManager]:  * TransformationType=BV_TO_INT_LAZY
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-01-10 17:48:21,860 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-01-10 17:48:21,880 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-01-10 17:48:21,882 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-01-10 17:48:21,883 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-01-10 17:48:21,884 INFO  L275        PluginConnector]: CDTParser initialized
[2022-01-10 17:48:21,885 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal.i
[2022-01-10 17:48:21,939 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfa4e380/ec0ff06d20c1486aa2cf04bf1e197488/FLAG317fe420c
[2022-01-10 17:48:22,313 INFO  L306              CDTParser]: Found 1 translation units.
[2022-01-10 17:48:22,314 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal.i
[2022-01-10 17:48:22,334 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfa4e380/ec0ff06d20c1486aa2cf04bf1e197488/FLAG317fe420c
[2022-01-10 17:48:22,684 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfa4e380/ec0ff06d20c1486aa2cf04bf1e197488
[2022-01-10 17:48:22,685 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-01-10 17:48:22,686 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2022-01-10 17:48:22,690 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-01-10 17:48:22,690 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-01-10 17:48:22,692 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-01-10 17:48:22,693 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:48:22" (1/1) ...
[2022-01-10 17:48:22,695 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e95dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:22, skipping insertion in model container
[2022-01-10 17:48:22,695 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:48:22" (1/1) ...
[2022-01-10 17:48:22,699 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-01-10 17:48:22,720 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-01-10 17:48:22,978 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal.i[24706,24719]
[2022-01-10 17:48:22,980 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-01-10 17:48:22,995 INFO  L203         MainTranslator]: Completed pre-run
[2022-01-10 17:48:23,031 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal.i[24706,24719]
[2022-01-10 17:48:23,031 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-01-10 17:48:23,054 INFO  L208         MainTranslator]: Completed translation
[2022-01-10 17:48:23,055 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23 WrapperNode
[2022-01-10 17:48:23,055 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-01-10 17:48:23,056 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-01-10 17:48:23,056 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-01-10 17:48:23,056 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-01-10 17:48:23,063 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,074 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,092 INFO  L137                Inliner]: procedures = 130, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143
[2022-01-10 17:48:23,092 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-01-10 17:48:23,093 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-01-10 17:48:23,093 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-01-10 17:48:23,093 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-01-10 17:48:23,098 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,099 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,101 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,102 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,111 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,114 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,116 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,118 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-01-10 17:48:23,119 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-01-10 17:48:23,119 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-01-10 17:48:23,119 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-01-10 17:48:23,131 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,136 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-01-10 17:48:23,144 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-01-10 17:48:23,154 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-01-10 17:48:23,156 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-01-10 17:48:23,181 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2022-01-10 17:48:23,181 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-01-10 17:48:23,181 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-01-10 17:48:23,181 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-01-10 17:48:23,181 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2022-01-10 17:48:23,181 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2022-01-10 17:48:23,181 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-01-10 17:48:23,182 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2022-01-10 17:48:23,182 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2022-01-10 17:48:23,182 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2022-01-10 17:48:23,182 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-01-10 17:48:23,182 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-01-10 17:48:23,284 INFO  L234             CfgBuilder]: Building ICFG
[2022-01-10 17:48:23,285 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-01-10 17:48:23,638 INFO  L275             CfgBuilder]: Performing block encoding
[2022-01-10 17:48:23,642 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-01-10 17:48:23,642 INFO  L299             CfgBuilder]: Removed 4 assume(true) statements.
[2022-01-10 17:48:23,643 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:48:23 BoogieIcfgContainer
[2022-01-10 17:48:23,643 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-01-10 17:48:23,644 INFO  L113        PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-01-10 17:48:23,644 INFO  L271        PluginConnector]: Initializing IcfgTransformer...
[2022-01-10 17:48:23,646 INFO  L275        PluginConnector]: IcfgTransformer initialized
[2022-01-10 17:48:23,648 INFO  L185        PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:48:23" (1/1) ...
[2022-01-10 17:48:23,720 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:48:23 BasicIcfg
[2022-01-10 17:48:23,721 INFO  L132        PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-01-10 17:48:23,722 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-01-10 17:48:23,722 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-01-10 17:48:23,724 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-01-10 17:48:23,724 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:48:22" (1/4) ...
[2022-01-10 17:48:23,725 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323a57be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:48:23, skipping insertion in model container
[2022-01-10 17:48:23,725 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:23" (2/4) ...
[2022-01-10 17:48:23,725 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323a57be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:48:23, skipping insertion in model container
[2022-01-10 17:48:23,725 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:48:23" (3/4) ...
[2022-01-10 17:48:23,725 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323a57be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:48:23, skipping insertion in model container
[2022-01-10 17:48:23,725 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:48:23" (4/4) ...
[2022-01-10 17:48:23,726 INFO  L111   eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.iTransformedIcfg
[2022-01-10 17:48:23,729 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-01-10 17:48:23,730 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-01-10 17:48:23,756 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-01-10 17:48:23,760 INFO  L339      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2022-01-10 17:48:23,760 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-01-10 17:48:23,768 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 30 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:23,771 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-01-10 17:48:23,771 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:23,772 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-10 17:48:23,772 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:23,775 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:23,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 840057478, now seen corresponding path program 1 times
[2022-01-10 17:48:23,781 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:23,781 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128776527]
[2022-01-10 17:48:23,781 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:23,782 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:23,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:23,975 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:23,976 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:23,976 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128776527]
[2022-01-10 17:48:23,977 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128776527] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-10 17:48:23,977 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-10 17:48:23,977 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-01-10 17:48:23,978 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761228869]
[2022-01-10 17:48:23,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-10 17:48:23,981 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-01-10 17:48:23,981 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-10 17:48:24,002 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-01-10 17:48:24,003 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-01-10 17:48:24,005 INFO  L87              Difference]: Start difference. First operand  has 30 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,018 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-01-10 17:48:24,018 INFO  L93              Difference]: Finished difference Result 52 states and 78 transitions.
[2022-01-10 17:48:24,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2022-01-10 17:48:24,020 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2022-01-10 17:48:24,020 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-01-10 17:48:24,025 INFO  L225             Difference]: With dead ends: 52
[2022-01-10 17:48:24,025 INFO  L226             Difference]: Without dead ends: 23
[2022-01-10 17:48:24,027 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-01-10 17:48:24,030 INFO  L933         BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-01-10 17:48:24,030 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-01-10 17:48:24,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2022-01-10 17:48:24,057 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2022-01-10 17:48:24,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions.
[2022-01-10 17:48:24,060 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15
[2022-01-10 17:48:24,060 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-01-10 17:48:24,061 INFO  L470      AbstractCegarLoop]: Abstraction has 23 states and 30 transitions.
[2022-01-10 17:48:24,061 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,062 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions.
[2022-01-10 17:48:24,062 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-01-10 17:48:24,062 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:24,063 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-10 17:48:24,063 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-01-10 17:48:24,063 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:24,064 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:24,064 INFO  L85        PathProgramCache]: Analyzing trace with hash 1434159113, now seen corresponding path program 1 times
[2022-01-10 17:48:24,065 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:24,065 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297781795]
[2022-01-10 17:48:24,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:24,065 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:24,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:24,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:24,202 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:24,202 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297781795]
[2022-01-10 17:48:24,202 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297781795] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-10 17:48:24,203 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-10 17:48:24,203 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-01-10 17:48:24,203 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45242454]
[2022-01-10 17:48:24,203 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-10 17:48:24,204 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-01-10 17:48:24,204 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-10 17:48:24,204 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-01-10 17:48:24,204 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-01-10 17:48:24,205 INFO  L87              Difference]: Start difference. First operand 23 states and 30 transitions. Second operand  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-01-10 17:48:24,250 INFO  L93              Difference]: Finished difference Result 38 states and 50 transitions.
[2022-01-10 17:48:24,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-01-10 17:48:24,250 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2022-01-10 17:48:24,250 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-01-10 17:48:24,251 INFO  L225             Difference]: With dead ends: 38
[2022-01-10 17:48:24,251 INFO  L226             Difference]: Without dead ends: 31
[2022-01-10 17:48:24,251 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 17:48:24,252 INFO  L933         BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-01-10 17:48:24,252 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-01-10 17:48:24,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2022-01-10 17:48:24,255 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25.
[2022-01-10 17:48:24,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions.
[2022-01-10 17:48:24,256 INFO  L78                 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 15
[2022-01-10 17:48:24,256 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-01-10 17:48:24,256 INFO  L470      AbstractCegarLoop]: Abstraction has 25 states and 33 transitions.
[2022-01-10 17:48:24,256 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,256 INFO  L276                IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions.
[2022-01-10 17:48:24,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-01-10 17:48:24,257 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:24,257 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-10 17:48:24,257 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-01-10 17:48:24,257 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:24,257 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:24,258 INFO  L85        PathProgramCache]: Analyzing trace with hash -1840113513, now seen corresponding path program 1 times
[2022-01-10 17:48:24,258 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:24,258 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325601911]
[2022-01-10 17:48:24,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:24,258 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:24,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:24,560 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:24,560 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:24,561 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325601911]
[2022-01-10 17:48:24,562 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325601911] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-10 17:48:24,562 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-10 17:48:24,562 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-01-10 17:48:24,562 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586969797]
[2022-01-10 17:48:24,562 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-10 17:48:24,562 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-01-10 17:48:24,563 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-10 17:48:24,563 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-01-10 17:48:24,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-01-10 17:48:24,564 INFO  L87              Difference]: Start difference. First operand 25 states and 33 transitions. Second operand  has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,779 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-01-10 17:48:24,780 INFO  L93              Difference]: Finished difference Result 38 states and 47 transitions.
[2022-01-10 17:48:24,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2022-01-10 17:48:24,781 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2022-01-10 17:48:24,781 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-01-10 17:48:24,782 INFO  L225             Difference]: With dead ends: 38
[2022-01-10 17:48:24,782 INFO  L226             Difference]: Without dead ends: 35
[2022-01-10 17:48:24,782 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2022-01-10 17:48:24,783 INFO  L933         BasicCegarLoop]: 21 mSDtfsCounter, 108 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-01-10 17:48:24,783 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 83 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-01-10 17:48:24,784 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2022-01-10 17:48:24,786 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27.
[2022-01-10 17:48:24,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions.
[2022-01-10 17:48:24,787 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16
[2022-01-10 17:48:24,787 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-01-10 17:48:24,787 INFO  L470      AbstractCegarLoop]: Abstraction has 27 states and 35 transitions.
[2022-01-10 17:48:24,787 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:24,787 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions.
[2022-01-10 17:48:24,788 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-01-10 17:48:24,788 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:24,788 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-10 17:48:24,788 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-01-10 17:48:24,788 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:24,788 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:24,789 INFO  L85        PathProgramCache]: Analyzing trace with hash -1840112490, now seen corresponding path program 1 times
[2022-01-10 17:48:24,789 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:24,789 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692731422]
[2022-01-10 17:48:24,789 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:24,789 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:24,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:25,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:25,164 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:25,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692731422]
[2022-01-10 17:48:25,165 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692731422] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-10 17:48:25,165 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-10 17:48:25,165 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-01-10 17:48:25,166 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187160493]
[2022-01-10 17:48:25,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-10 17:48:25,166 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-01-10 17:48:25,166 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-10 17:48:25,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-01-10 17:48:25,167 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-01-10 17:48:25,167 INFO  L87              Difference]: Start difference. First operand 27 states and 35 transitions. Second operand  has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:25,588 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-01-10 17:48:25,588 INFO  L93              Difference]: Finished difference Result 77 states and 101 transitions.
[2022-01-10 17:48:25,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2022-01-10 17:48:25,589 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2022-01-10 17:48:25,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-01-10 17:48:25,589 INFO  L225             Difference]: With dead ends: 77
[2022-01-10 17:48:25,589 INFO  L226             Difference]: Without dead ends: 52
[2022-01-10 17:48:25,590 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156
[2022-01-10 17:48:25,590 INFO  L933         BasicCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-01-10 17:48:25,591 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 107 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-01-10 17:48:25,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2022-01-10 17:48:25,595 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41.
[2022-01-10 17:48:25,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:25,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions.
[2022-01-10 17:48:25,596 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 16
[2022-01-10 17:48:25,597 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-01-10 17:48:25,597 INFO  L470      AbstractCegarLoop]: Abstraction has 41 states and 53 transitions.
[2022-01-10 17:48:25,597 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:25,597 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions.
[2022-01-10 17:48:25,618 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-01-10 17:48:25,618 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:25,619 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-10 17:48:25,619 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-01-10 17:48:25,619 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:25,620 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:25,620 INFO  L85        PathProgramCache]: Analyzing trace with hash -1811483339, now seen corresponding path program 1 times
[2022-01-10 17:48:25,620 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:25,620 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543104142]
[2022-01-10 17:48:25,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:25,620 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:25,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:25,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:25,699 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:25,699 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543104142]
[2022-01-10 17:48:25,700 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543104142] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-10 17:48:25,700 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-10 17:48:25,700 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-01-10 17:48:25,700 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383695407]
[2022-01-10 17:48:25,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-10 17:48:25,700 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-01-10 17:48:25,701 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-10 17:48:25,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-01-10 17:48:25,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-01-10 17:48:25,701 INFO  L87              Difference]: Start difference. First operand 41 states and 53 transitions. Second operand  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:25,710 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-01-10 17:48:25,710 INFO  L93              Difference]: Finished difference Result 52 states and 66 transitions.
[2022-01-10 17:48:25,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-01-10 17:48:25,710 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2022-01-10 17:48:25,711 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-01-10 17:48:25,711 INFO  L225             Difference]: With dead ends: 52
[2022-01-10 17:48:25,711 INFO  L226             Difference]: Without dead ends: 32
[2022-01-10 17:48:25,711 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 17:48:25,712 INFO  L933         BasicCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-01-10 17:48:25,712 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-01-10 17:48:25,713 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2022-01-10 17:48:25,725 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31.
[2022-01-10 17:48:25,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:25,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions.
[2022-01-10 17:48:25,730 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 16
[2022-01-10 17:48:25,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-01-10 17:48:25,730 INFO  L470      AbstractCegarLoop]: Abstraction has 31 states and 39 transitions.
[2022-01-10 17:48:25,730 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:25,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions.
[2022-01-10 17:48:25,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-01-10 17:48:25,731 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:25,731 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-10 17:48:25,731 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-01-10 17:48:25,731 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:25,731 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:25,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -1980264782, now seen corresponding path program 1 times
[2022-01-10 17:48:25,732 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:25,732 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317944046]
[2022-01-10 17:48:25,732 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:25,732 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:25,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:25,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:25,850 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:25,850 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317944046]
[2022-01-10 17:48:25,850 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317944046] provided 0 perfect and 1 imperfect interpolant sequences
[2022-01-10 17:48:25,850 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14124529]
[2022-01-10 17:48:25,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:25,850 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-01-10 17:48:25,850 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-01-10 17:48:25,852 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-01-10 17:48:25,874 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-01-10 17:48:25,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:25,999 INFO  L263         TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 68 conjunts are in the unsatisfiable core
[2022-01-10 17:48:26,023 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-01-10 17:48:26,108 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-01-10 17:48:26,282 INFO  L353             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2022-01-10 17:48:26,282 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2022-01-10 17:48:26,350 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:26,351 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17
[2022-01-10 17:48:26,364 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2022-01-10 17:48:26,496 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:26,497 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2022-01-10 17:48:26,512 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:26,513 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17
[2022-01-10 17:48:26,531 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2022-01-10 17:48:26,534 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2022-01-10 17:48:26,601 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2022-01-10 17:48:26,608 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:26,608 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2022-01-10 17:48:26,614 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2022-01-10 17:48:26,654 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20
[2022-01-10 17:48:26,657 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17
[2022-01-10 17:48:26,716 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2022-01-10 17:48:26,732 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:26,732 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-01-10 17:48:26,732 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [14124529] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-10 17:48:26,732 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-01-10 17:48:26,732 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15
[2022-01-10 17:48:26,732 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067706238]
[2022-01-10 17:48:26,732 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-10 17:48:26,734 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-01-10 17:48:26,734 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-10 17:48:26,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-01-10 17:48:26,735 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210
[2022-01-10 17:48:26,735 INFO  L87              Difference]: Start difference. First operand 31 states and 39 transitions. Second operand  has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:27,356 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-01-10 17:48:27,356 INFO  L93              Difference]: Finished difference Result 41 states and 50 transitions.
[2022-01-10 17:48:27,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-01-10 17:48:27,357 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-01-10 17:48:27,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-01-10 17:48:27,358 INFO  L225             Difference]: With dead ends: 41
[2022-01-10 17:48:27,358 INFO  L226             Difference]: Without dead ends: 39
[2022-01-10 17:48:27,358 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552
[2022-01-10 17:48:27,359 INFO  L933         BasicCegarLoop]: 14 mSDtfsCounter, 91 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-01-10 17:48:27,359 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 80 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-01-10 17:48:27,359 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2022-01-10 17:48:27,363 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32.
[2022-01-10 17:48:27,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:27,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions.
[2022-01-10 17:48:27,364 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 21
[2022-01-10 17:48:27,364 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-01-10 17:48:27,364 INFO  L470      AbstractCegarLoop]: Abstraction has 32 states and 40 transitions.
[2022-01-10 17:48:27,364 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:27,364 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions.
[2022-01-10 17:48:27,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-01-10 17:48:27,364 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:27,364 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-10 17:48:27,395 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-01-10 17:48:27,576 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2022-01-10 17:48:27,576 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:27,577 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:27,577 INFO  L85        PathProgramCache]: Analyzing trace with hash 1275866574, now seen corresponding path program 1 times
[2022-01-10 17:48:27,577 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:27,577 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002101719]
[2022-01-10 17:48:27,577 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:27,577 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:27,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:27,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:27,869 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:27,869 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002101719]
[2022-01-10 17:48:27,869 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002101719] provided 0 perfect and 1 imperfect interpolant sequences
[2022-01-10 17:48:27,869 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884389775]
[2022-01-10 17:48:27,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:27,870 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-01-10 17:48:27,870 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-01-10 17:48:27,871 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-01-10 17:48:27,872 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-01-10 17:48:28,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:28,007 INFO  L263         TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 30 conjunts are in the unsatisfiable core
[2022-01-10 17:48:28,009 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-01-10 17:48:28,137 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:28,137 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17
[2022-01-10 17:48:28,203 INFO  L353             Elim1Store]: treesize reduction 21, result has 47.5 percent of original size
[2022-01-10 17:48:28,203 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41
[2022-01-10 17:48:28,208 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:28,217 INFO  L353             Elim1Store]: treesize reduction 19, result has 32.1 percent of original size
[2022-01-10 17:48:28,217 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 46
[2022-01-10 17:48:28,252 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2022-01-10 17:48:28,309 INFO  L353             Elim1Store]: treesize reduction 21, result has 47.5 percent of original size
[2022-01-10 17:48:28,309 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35
[2022-01-10 17:48:28,420 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-01-10 17:48:28,420 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33
[2022-01-10 17:48:28,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-01-10 17:48:28,443 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-01-10 17:48:28,443 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884389775] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-10 17:48:28,443 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-01-10 17:48:28,443 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 20
[2022-01-10 17:48:28,443 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604015544]
[2022-01-10 17:48:28,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-10 17:48:28,443 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-01-10 17:48:28,443 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-10 17:48:28,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-01-10 17:48:28,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380
[2022-01-10 17:48:28,444 INFO  L87              Difference]: Start difference. First operand 32 states and 40 transitions. Second operand  has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:28,809 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-01-10 17:48:28,809 INFO  L93              Difference]: Finished difference Result 65 states and 83 transitions.
[2022-01-10 17:48:28,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2022-01-10 17:48:28,810 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-01-10 17:48:28,810 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-01-10 17:48:28,810 INFO  L225             Difference]: With dead ends: 65
[2022-01-10 17:48:28,810 INFO  L226             Difference]: Without dead ends: 39
[2022-01-10 17:48:28,811 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756
[2022-01-10 17:48:28,811 INFO  L933         BasicCegarLoop]: 12 mSDtfsCounter, 117 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-01-10 17:48:28,812 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 43 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 102 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time]
[2022-01-10 17:48:28,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2022-01-10 17:48:28,816 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33.
[2022-01-10 17:48:28,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:28,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions.
[2022-01-10 17:48:28,817 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 21
[2022-01-10 17:48:28,817 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-01-10 17:48:28,817 INFO  L470      AbstractCegarLoop]: Abstraction has 33 states and 40 transitions.
[2022-01-10 17:48:28,817 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:28,817 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions.
[2022-01-10 17:48:28,817 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2022-01-10 17:48:28,817 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:28,817 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-10 17:48:28,838 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-01-10 17:48:29,032 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2022-01-10 17:48:29,033 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:29,033 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:29,033 INFO  L85        PathProgramCache]: Analyzing trace with hash 1275867597, now seen corresponding path program 1 times
[2022-01-10 17:48:29,033 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:29,033 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525006914]
[2022-01-10 17:48:29,033 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:29,034 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:29,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:29,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-01-10 17:48:29,110 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:29,111 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525006914]
[2022-01-10 17:48:29,111 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525006914] provided 0 perfect and 1 imperfect interpolant sequences
[2022-01-10 17:48:29,111 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774886258]
[2022-01-10 17:48:29,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:29,111 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-01-10 17:48:29,111 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-01-10 17:48:29,112 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-01-10 17:48:29,113 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-01-10 17:48:29,489 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:29,492 INFO  L263         TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-01-10 17:48:29,493 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-01-10 17:48:29,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-01-10 17:48:29,555 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-01-10 17:48:29,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-01-10 17:48:29,644 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [774886258] provided 0 perfect and 2 imperfect interpolant sequences
[2022-01-10 17:48:29,644 INFO  L186   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-01-10 17:48:29,644 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2022-01-10 17:48:29,644 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790864980]
[2022-01-10 17:48:29,645 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-01-10 17:48:29,645 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-01-10 17:48:29,645 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-10 17:48:29,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-01-10 17:48:29,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2022-01-10 17:48:29,645 INFO  L87              Difference]: Start difference. First operand 33 states and 40 transitions. Second operand  has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:29,667 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-01-10 17:48:29,667 INFO  L93              Difference]: Finished difference Result 61 states and 75 transitions.
[2022-01-10 17:48:29,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2022-01-10 17:48:29,667 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21
[2022-01-10 17:48:29,668 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-01-10 17:48:29,668 INFO  L225             Difference]: With dead ends: 61
[2022-01-10 17:48:29,668 INFO  L226             Difference]: Without dead ends: 39
[2022-01-10 17:48:29,668 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2022-01-10 17:48:29,669 INFO  L933         BasicCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-01-10 17:48:29,669 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 128 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-01-10 17:48:29,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2022-01-10 17:48:29,674 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35.
[2022-01-10 17:48:29,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:29,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions.
[2022-01-10 17:48:29,675 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 21
[2022-01-10 17:48:29,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-01-10 17:48:29,675 INFO  L470      AbstractCegarLoop]: Abstraction has 35 states and 42 transitions.
[2022-01-10 17:48:29,675 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-01-10 17:48:29,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions.
[2022-01-10 17:48:29,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-01-10 17:48:29,675 INFO  L506         BasicCegarLoop]: Found error trace
[2022-01-10 17:48:29,675 INFO  L514         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]
[2022-01-10 17:48:29,709 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-01-10 17:48:29,893 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-01-10 17:48:29,894 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-01-10 17:48:29,894 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-10 17:48:29,894 INFO  L85        PathProgramCache]: Analyzing trace with hash 708039506, now seen corresponding path program 1 times
[2022-01-10 17:48:29,894 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-10 17:48:29,894 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880075003]
[2022-01-10 17:48:29,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:29,895 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-10 17:48:30,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:31,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:31,210 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-10 17:48:31,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880075003]
[2022-01-10 17:48:31,211 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880075003] provided 0 perfect and 1 imperfect interpolant sequences
[2022-01-10 17:48:31,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564677583]
[2022-01-10 17:48:31,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-10 17:48:31,211 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-01-10 17:48:31,211 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-01-10 17:48:31,212 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-01-10 17:48:31,247 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-01-10 17:48:31,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-10 17:48:31,645 INFO  L263         TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 124 conjunts are in the unsatisfiable core
[2022-01-10 17:48:31,650 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-01-10 17:48:31,682 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2022-01-10 17:48:31,902 INFO  L353             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2022-01-10 17:48:31,903 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26
[2022-01-10 17:48:32,019 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:32,020 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:48:32,020 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23
[2022-01-10 17:48:32,038 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:32,039 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:32,040 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:32,042 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30
[2022-01-10 17:48:32,052 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:32,053 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23
[2022-01-10 17:48:32,159 INFO  L353             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2022-01-10 17:48:32,159 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 83
[2022-01-10 17:48:32,165 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46
[2022-01-10 17:48:32,170 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24
[2022-01-10 17:48:32,571 INFO  L353             Elim1Store]: treesize reduction 8, result has 78.4 percent of original size
[2022-01-10 17:48:32,572 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41
[2022-01-10 17:48:32,759 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:32,768 INFO  L353             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2022-01-10 17:48:32,769 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 156
[2022-01-10 17:48:32,776 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24
[2022-01-10 17:48:32,782 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:32,782 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:32,783 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 152
[2022-01-10 17:48:33,308 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,310 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,311 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:48:33,312 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,315 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-01-10 17:48:33,316 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 269 treesize of output 183
[2022-01-10 17:48:33,323 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,335 INFO  L353             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2022-01-10 17:48:33,335 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 185
[2022-01-10 17:48:33,344 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,345 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2022-01-10 17:48:33,351 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,352 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,353 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 119
[2022-01-10 17:48:33,359 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:48:33,361 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,362 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13
[2022-01-10 17:48:33,368 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24
[2022-01-10 17:48:33,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,530 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,531 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:48:33,532 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,533 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,542 INFO  L353             Elim1Store]: treesize reduction 25, result has 37.5 percent of original size
[2022-01-10 17:48:33,543 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 148 treesize of output 88
[2022-01-10 17:48:33,549 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,550 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135
[2022-01-10 17:48:33,560 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30
[2022-01-10 17:48:33,761 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,762 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,764 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:48:33,765 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2022-01-10 17:48:33,767 INFO  L353             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2022-01-10 17:48:33,767 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 46
[2022-01-10 17:48:33,772 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17
[2022-01-10 17:48:33,798 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2022-01-10 17:48:33,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-10 17:48:33,824 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2022-01-10 17:48:35,951 WARN  L838   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_750 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_6| Int) (v_ArrVal_766 Int) (v_ArrVal_754 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_750))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (let ((.cse11 (select .cse10 .cse7)) (.cse8 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_6| 4) 18446744073709551616))) (let ((.cse3 (select .cse11 .cse8)) (.cse2 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_748))) (let ((.cse1 (select (select .cse2 .cse7) .cse8)) (.cse0 (select (select (store (store (store .cse2 .cse7 v_ArrVal_756) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_759) .cse3 v_ArrVal_765) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_6|)) (not (<= 0 .cse1)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_6| (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (and (= .cse1 0) (= .cse3 0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (let ((.cse5 (mod (+ .cse1 12) 18446744073709551616))) (select (let ((.cse4 (store (let ((.cse6 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_751))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_754))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_760))) (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_766))) (select (select (let ((.cse9 (store (store .cse10 .cse7 (store .cse11 .cse8 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_757))) (store .cse9 .cse3 (store (select .cse9 .cse3) .cse5 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) .cse0))))))))) is different from false
[2022-01-10 17:49:01,139 WARN  L838   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_750 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_6| Int) (v_ArrVal_766 Int) (v_ArrVal_754 Int) (v_ArrVal_744 (Array Int Int)) (v_ArrVal_765 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2| Int) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_759 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_744))) (let ((.cse13 (store .cse6 |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2| v_ArrVal_750))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (let ((.cse14 (select .cse13 .cse10)) (.cse11 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_6| 4) 18446744073709551616)) (.cse1 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_746))) (let ((.cse5 (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2| v_ArrVal_748)) (.cse4 (select .cse14 .cse11))) (let ((.cse0 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2|)) (.cse2 (select (select (store (store (store .cse5 .cse10 v_ArrVal_756) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2| v_ArrVal_759) .cse4 v_ArrVal_765) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse3 (select (select .cse5 .cse10) .cse11))) (or (not (< |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2| |c_#StackHeapBarrierInt|)) (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_6|)) (not (<= .cse0 0)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (not (<= 0 .cse2)) (and (= .cse3 0) (= .cse4 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_6| (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (let ((.cse8 (mod (+ 12 .cse3) 18446744073709551616))) (select (let ((.cse7 (store (let ((.cse9 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_745) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2| v_ArrVal_751))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_754))) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2| v_ArrVal_760))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse8 v_ArrVal_766))) (select (select (let ((.cse12 (store (store .cse13 .cse10 (store .cse14 .cse11 |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2|)) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2| v_ArrVal_757))) (store .cse12 .cse4 (store (select .cse12 .cse4) .cse8 |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_2|))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) .cse2)) (not (<= 0 .cse3)))))))))) is different from false
[2022-01-10 17:49:01,197 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:49:01,197 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:49:01,203 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:49:01,238 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-01-10 17:49:01,238 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1040 treesize of output 985
[2022-01-10 17:49:01,254 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:49:01,291 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-01-10 17:49:01,292 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1313 treesize of output 710
[2022-01-10 17:49:01,309 INFO  L173   IndexEqualityManager]: detected equality via solver
[2022-01-10 17:49:01,327 INFO  L353             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2022-01-10 17:49:01,327 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 738 treesize of output 610
[2022-01-10 17:49:20,340 WARN  L228               SmtUtils]: Spent 18.05s on a formula simplification. DAG size of input: 209 DAG size of output: 177 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1)
[2022-01-10 17:49:20,340 INFO  L353             Elim1Store]: treesize reduction 80, result has 84.2 percent of original size
[2022-01-10 17:49:20,352 INFO  L387             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 14 new quantified variables, introduced 45 case distinctions, treesize of input 1447313061 treesize of output 1410745883