/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_NONE.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:40:57,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:40:57,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:40:57,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:40:57,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:40:57,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:40:57,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:40:57,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:40:57,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:40:57,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:40:57,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:40:57,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:40:57,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:40:57,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:40:57,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:40:57,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:40:57,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:40:57,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:40:57,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:40:57,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:40:57,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:40:57,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:40:57,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:40:57,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:40:57,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:40:57,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:40:57,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:40:57,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:40:57,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:40:57,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:40:57,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:40:57,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:40:57,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:40:57,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:40:57,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:40:57,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:40:57,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:40:57,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:40:57,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:40:57,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:40:57,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:40:57,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:40:57,637 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:40:57,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:40:57,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:40:57,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:40:57,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:40:57,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:40:57,639 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:40:57,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:40:57,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:40:57,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:40:57,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:40:57,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:40:57,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:40:57,642 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:40:57,642 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:40:57,643 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:40:57,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:40:57,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:40:57,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:40:57,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:40:57,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:40:57,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:40:57,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:40:57,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:40:57,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:40:57,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:40:57,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:40:57,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:40:57,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:40:57,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:40:57,644 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:40:57,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:40:57,645 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:40:57,646 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 21:40:57,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:40:57,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:40:57,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:40:57,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:40:57,875 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:40:57,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-01-10 21:40:57,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2dace71/3445a9538c2b48e9bdfe7659af311337/FLAGb70e9a40d [2022-01-10 21:40:58,453 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:40:58,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-01-10 21:40:58,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2dace71/3445a9538c2b48e9bdfe7659af311337/FLAGb70e9a40d [2022-01-10 21:40:58,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2dace71/3445a9538c2b48e9bdfe7659af311337 [2022-01-10 21:40:58,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:40:58,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:40:58,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:40:58,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:40:58,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:40:58,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:40:58" (1/1) ... [2022-01-10 21:40:58,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1075db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:58, skipping insertion in model container [2022-01-10 21:40:58,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:40:58" (1/1) ... [2022-01-10 21:40:58,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:40:59,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:40:59,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-01-10 21:40:59,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:40:59,365 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:40:59,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-01-10 21:40:59,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:40:59,495 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:40:59,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59 WrapperNode [2022-01-10 21:40:59,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:40:59,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:40:59,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:40:59,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:40:59,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,651 INFO L137 Inliner]: procedures = 41, calls = 108, calls flagged for inlining = 103, calls inlined = 277, statements flattened = 5108 [2022-01-10 21:40:59,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:40:59,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:40:59,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:40:59,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:40:59,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:40:59,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:40:59,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:40:59,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:40:59,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (1/1) ... [2022-01-10 21:40:59,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:40:59,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:40:59,805 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 21:40:59,806 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 21:40:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:40:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:40:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:40:59,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:41:00,020 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:41:00,022 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:41:00,030 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,031 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,037 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,042 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,049 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,056 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,064 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,075 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,081 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,086 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,091 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,096 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,104 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,115 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,119 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,126 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,150 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,157 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,178 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,187 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,208 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,211 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,215 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,217 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,219 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,223 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,226 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,246 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,249 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,252 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,255 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,258 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,259 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,262 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,263 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,266 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,266 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,268 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,269 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,271 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,272 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,274 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:00,276 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:02,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2022-01-10 21:41:02,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2022-01-10 21:41:02,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2022-01-10 21:41:02,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2022-01-10 21:41:02,229 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2022-01-10 21:41:02,230 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2022-01-10 21:41:02,231 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0bv32; [2022-01-10 21:41:02,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2022-01-10 21:41:02,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2022-01-10 21:41:02,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2022-01-10 21:41:02,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2022-01-10 21:41:02,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2022-01-10 21:41:02,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2022-01-10 21:41:02,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2022-01-10 21:41:02,232 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-01-10 21:41:02,233 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2022-01-10 21:41:02,234 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2022-01-10 21:41:02,235 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2022-01-10 21:41:02,236 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2022-01-10 21:41:02,237 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2022-01-10 21:41:02,238 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2022-01-10 21:41:02,238 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2022-01-10 21:41:02,238 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2022-01-10 21:41:02,238 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2022-01-10 21:41:02,238 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2022-01-10 21:41:02,238 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2022-01-10 21:41:02,238 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2022-01-10 21:41:02,238 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:41:02,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:41:02,254 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:41:02,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:02 BoogieIcfgContainer [2022-01-10 21:41:02,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:41:02,258 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:41:02,258 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:41:02,259 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:41:02,262 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:02" (1/1) ... [2022-01-10 21:41:02,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:41:02 BasicIcfg [2022-01-10 21:41:02,716 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:41:02,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:41:02,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:41:02,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:41:02,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:40:58" (1/4) ... [2022-01-10 21:41:02,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@841d295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:41:02, skipping insertion in model container [2022-01-10 21:41:02,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:40:59" (2/4) ... [2022-01-10 21:41:02,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@841d295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:41:02, skipping insertion in model container [2022-01-10 21:41:02,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:02" (3/4) ... [2022-01-10 21:41:02,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@841d295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:41:02, skipping insertion in model container [2022-01-10 21:41:02,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:41:02" (4/4) ... [2022-01-10 21:41:02,723 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.cTransformedIcfg [2022-01-10 21:41:02,727 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:41:02,728 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2022-01-10 21:41:02,770 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:41:02,776 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 21:41:02,776 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2022-01-10 21:41:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 1315 states, 1211 states have (on average 1.564822460776218) internal successors, (1895), 1314 states have internal predecessors, (1895), 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 21:41:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 21:41:02,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:02,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:02,874 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:02,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1926604320, now seen corresponding path program 1 times [2022-01-10 21:41:02,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:02,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532508774] [2022-01-10 21:41:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:02,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:03,151 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 21:41:03,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:03,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532508774] [2022-01-10 21:41:03,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532508774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:03,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:03,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:03,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056486469] [2022-01-10 21:41:03,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:03,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:03,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:03,185 INFO L87 Difference]: Start difference. First operand has 1315 states, 1211 states have (on average 1.564822460776218) internal successors, (1895), 1314 states have internal predecessors, (1895), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 21:41:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:03,755 INFO L93 Difference]: Finished difference Result 2227 states and 3191 transitions. [2022-01-10 21:41:03,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:03,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-01-10 21:41:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:03,773 INFO L225 Difference]: With dead ends: 2227 [2022-01-10 21:41:03,774 INFO L226 Difference]: Without dead ends: 1207 [2022-01-10 21:41:03,780 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 21:41:03,783 INFO L933 BasicCegarLoop]: 1681 mSDtfsCounter, 8 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:03,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 3007 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:41:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2022-01-10 21:41:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1207. [2022-01-10 21:41:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1104 states have (on average 1.5144927536231885) internal successors, (1672), 1206 states have internal predecessors, (1672), 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 21:41:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1672 transitions. [2022-01-10 21:41:03,861 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1672 transitions. Word has length 12 [2022-01-10 21:41:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:03,861 INFO L470 AbstractCegarLoop]: Abstraction has 1207 states and 1672 transitions. [2022-01-10 21:41:03,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 21:41:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1672 transitions. [2022-01-10 21:41:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 21:41:03,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:03,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:03,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:41:03,863 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:03,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1147815190, now seen corresponding path program 1 times [2022-01-10 21:41:03,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:03,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342601054] [2022-01-10 21:41:03,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:03,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:03,939 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 21:41:03,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:03,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342601054] [2022-01-10 21:41:03,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342601054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:03,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:03,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:03,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052340432] [2022-01-10 21:41:03,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:03,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:03,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:03,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:03,942 INFO L87 Difference]: Start difference. First operand 1207 states and 1672 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 21:41:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:04,391 INFO L93 Difference]: Finished difference Result 1487 states and 2042 transitions. [2022-01-10 21:41:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-01-10 21:41:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:04,397 INFO L225 Difference]: With dead ends: 1487 [2022-01-10 21:41:04,397 INFO L226 Difference]: Without dead ends: 1289 [2022-01-10 21:41:04,398 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 21:41:04,399 INFO L933 BasicCegarLoop]: 1548 mSDtfsCounter, 1026 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:04,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 2075 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:41:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-01-10 21:41:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1263. [2022-01-10 21:41:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1196 states have (on average 1.4816053511705685) internal successors, (1772), 1262 states have internal predecessors, (1772), 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 21:41:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1772 transitions. [2022-01-10 21:41:04,454 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1772 transitions. Word has length 14 [2022-01-10 21:41:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:04,454 INFO L470 AbstractCegarLoop]: Abstraction has 1263 states and 1772 transitions. [2022-01-10 21:41:04,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 21:41:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1772 transitions. [2022-01-10 21:41:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 21:41:04,459 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:04,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:04,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:41:04,465 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:04,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:04,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1674149450, now seen corresponding path program 1 times [2022-01-10 21:41:04,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:04,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900746162] [2022-01-10 21:41:04,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:04,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:04,591 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 21:41:04,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:04,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900746162] [2022-01-10 21:41:04,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900746162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:04,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:04,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:04,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523231533] [2022-01-10 21:41:04,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:04,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:04,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:04,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:04,595 INFO L87 Difference]: Start difference. First operand 1263 states and 1772 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 21:41:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:04,712 INFO L93 Difference]: Finished difference Result 1657 states and 2293 transitions. [2022-01-10 21:41:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:04,713 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 21:41:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:04,718 INFO L225 Difference]: With dead ends: 1657 [2022-01-10 21:41:04,718 INFO L226 Difference]: Without dead ends: 1277 [2022-01-10 21:41:04,723 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 21:41:04,725 INFO L933 BasicCegarLoop]: 1348 mSDtfsCounter, 1243 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:04,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 1619 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-01-10 21:41:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1086. [2022-01-10 21:41:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1040 states have (on average 1.4730769230769232) internal successors, (1532), 1085 states have internal predecessors, (1532), 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 21:41:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1532 transitions. [2022-01-10 21:41:04,786 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1532 transitions. Word has length 16 [2022-01-10 21:41:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:04,786 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 1532 transitions. [2022-01-10 21:41:04,786 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 21:41:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1532 transitions. [2022-01-10 21:41:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 21:41:04,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:04,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:04,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:41:04,793 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1621560389, now seen corresponding path program 1 times [2022-01-10 21:41:04,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:04,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277934346] [2022-01-10 21:41:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:04,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:04,871 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 21:41:04,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:04,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277934346] [2022-01-10 21:41:04,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277934346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:04,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:04,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:04,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132077441] [2022-01-10 21:41:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:04,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:04,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:04,874 INFO L87 Difference]: Start difference. First operand 1086 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21:41:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:05,303 INFO L93 Difference]: Finished difference Result 1787 states and 2490 transitions. [2022-01-10 21:41:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-01-10 21:41:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:05,310 INFO L225 Difference]: With dead ends: 1787 [2022-01-10 21:41:05,310 INFO L226 Difference]: Without dead ends: 1550 [2022-01-10 21:41:05,311 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 21:41:05,312 INFO L933 BasicCegarLoop]: 1798 mSDtfsCounter, 525 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:05,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 2856 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 21:41:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2022-01-10 21:41:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1255. [2022-01-10 21:41:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1209 states have (on average 1.4755996691480562) internal successors, (1784), 1254 states have internal predecessors, (1784), 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 21:41:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1784 transitions. [2022-01-10 21:41:05,370 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1784 transitions. Word has length 18 [2022-01-10 21:41:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:05,370 INFO L470 AbstractCegarLoop]: Abstraction has 1255 states and 1784 transitions. [2022-01-10 21:41:05,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21:41:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1784 transitions. [2022-01-10 21:41:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 21:41:05,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:05,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:05,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:41:05,372 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1270208249, now seen corresponding path program 1 times [2022-01-10 21:41:05,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:05,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365094213] [2022-01-10 21:41:05,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:05,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:05,426 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 21:41:05,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:05,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365094213] [2022-01-10 21:41:05,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365094213] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:05,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:05,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:05,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893255293] [2022-01-10 21:41:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:05,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:05,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:05,451 INFO L87 Difference]: Start difference. First operand 1255 states and 1784 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 21:41:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:05,891 INFO L93 Difference]: Finished difference Result 1884 states and 2637 transitions. [2022-01-10 21:41:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2022-01-10 21:41:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:05,897 INFO L225 Difference]: With dead ends: 1884 [2022-01-10 21:41:05,897 INFO L226 Difference]: Without dead ends: 1156 [2022-01-10 21:41:05,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:05,902 INFO L933 BasicCegarLoop]: 1187 mSDtfsCounter, 2152 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:05,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2152 Valid, 1497 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 21:41:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2022-01-10 21:41:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1038. [2022-01-10 21:41:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1014 states have (on average 1.4220907297830374) internal successors, (1442), 1037 states have internal predecessors, (1442), 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 21:41:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1442 transitions. [2022-01-10 21:41:05,976 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1442 transitions. Word has length 19 [2022-01-10 21:41:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:05,979 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 1442 transitions. [2022-01-10 21:41:05,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 21:41:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1442 transitions. [2022-01-10 21:41:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 21:41:05,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:05,982 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 21:41:05,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:41:05,982 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash 948595952, now seen corresponding path program 1 times [2022-01-10 21:41:05,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:05,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992668718] [2022-01-10 21:41:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:05,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:06,043 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 21:41:06,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:06,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992668718] [2022-01-10 21:41:06,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992668718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:06,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:06,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:06,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483151931] [2022-01-10 21:41:06,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:06,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:06,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:06,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:06,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:06,046 INFO L87 Difference]: Start difference. First operand 1038 states and 1442 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 21:41:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:06,153 INFO L93 Difference]: Finished difference Result 1336 states and 1846 transitions. [2022-01-10 21:41:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:06,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 21:41:06,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:06,158 INFO L225 Difference]: With dead ends: 1336 [2022-01-10 21:41:06,158 INFO L226 Difference]: Without dead ends: 1081 [2022-01-10 21:41:06,159 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 21:41:06,159 INFO L933 BasicCegarLoop]: 1275 mSDtfsCounter, 228 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:06,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 2315 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-01-10 21:41:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1020. [2022-01-10 21:41:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 998 states have (on average 1.4168336673346693) internal successors, (1414), 1019 states have internal predecessors, (1414), 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 21:41:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1414 transitions. [2022-01-10 21:41:06,241 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1414 transitions. Word has length 21 [2022-01-10 21:41:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:06,241 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 1414 transitions. [2022-01-10 21:41:06,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 21:41:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1414 transitions. [2022-01-10 21:41:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 21:41:06,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:06,243 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, 1] [2022-01-10 21:41:06,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:41:06,243 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1737061464, now seen corresponding path program 1 times [2022-01-10 21:41:06,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:06,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717848148] [2022-01-10 21:41:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:06,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:06,283 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 21:41:06,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:06,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717848148] [2022-01-10 21:41:06,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717848148] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:06,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:06,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:06,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857632303] [2022-01-10 21:41:06,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:06,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:06,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:06,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:06,285 INFO L87 Difference]: Start difference. First operand 1020 states and 1414 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 21:41:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:06,569 INFO L93 Difference]: Finished difference Result 1020 states and 1414 transitions. [2022-01-10 21:41:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:06,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-01-10 21:41:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:06,573 INFO L225 Difference]: With dead ends: 1020 [2022-01-10 21:41:06,573 INFO L226 Difference]: Without dead ends: 1002 [2022-01-10 21:41:06,574 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 21:41:06,574 INFO L933 BasicCegarLoop]: 1159 mSDtfsCounter, 120 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:06,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 2039 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2022-01-10 21:41:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2022-01-10 21:41:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 989 states have (on average 1.4115267947421637) internal successors, (1396), 1001 states have internal predecessors, (1396), 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 21:41:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1396 transitions. [2022-01-10 21:41:06,651 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1396 transitions. Word has length 22 [2022-01-10 21:41:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:06,652 INFO L470 AbstractCegarLoop]: Abstraction has 1002 states and 1396 transitions. [2022-01-10 21:41:06,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 21:41:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1396 transitions. [2022-01-10 21:41:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 21:41:06,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:06,653 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, 1, 1, 1] [2022-01-10 21:41:06,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:41:06,654 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1214769845, now seen corresponding path program 1 times [2022-01-10 21:41:06,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:06,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770495384] [2022-01-10 21:41:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:06,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:06,713 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 21:41:06,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:06,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770495384] [2022-01-10 21:41:06,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770495384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:06,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:06,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:06,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757745033] [2022-01-10 21:41:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:06,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:06,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:06,715 INFO L87 Difference]: Start difference. First operand 1002 states and 1396 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 21:41:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:06,808 INFO L93 Difference]: Finished difference Result 1083 states and 1497 transitions. [2022-01-10 21:41:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2022-01-10 21:41:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:06,812 INFO L225 Difference]: With dead ends: 1083 [2022-01-10 21:41:06,812 INFO L226 Difference]: Without dead ends: 1060 [2022-01-10 21:41:06,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:06,813 INFO L933 BasicCegarLoop]: 1198 mSDtfsCounter, 1190 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:06,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1190 Valid, 1312 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2022-01-10 21:41:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1010. [2022-01-10 21:41:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 998 states have (on average 1.4238476953907815) internal successors, (1421), 1009 states have internal predecessors, (1421), 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 21:41:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1421 transitions. [2022-01-10 21:41:06,885 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1421 transitions. Word has length 24 [2022-01-10 21:41:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:06,885 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 1421 transitions. [2022-01-10 21:41:06,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 21:41:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1421 transitions. [2022-01-10 21:41:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 21:41:06,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:06,887 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, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:06,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:41:06,887 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:06,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -546596163, now seen corresponding path program 1 times [2022-01-10 21:41:06,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:06,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955418271] [2022-01-10 21:41:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:06,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:06,926 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 21:41:06,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:06,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955418271] [2022-01-10 21:41:06,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955418271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:06,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:06,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:06,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943331502] [2022-01-10 21:41:06,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:06,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:06,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:06,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:06,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:06,929 INFO L87 Difference]: Start difference. First operand 1010 states and 1421 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 21:41:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:07,017 INFO L93 Difference]: Finished difference Result 1233 states and 1720 transitions. [2022-01-10 21:41:07,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:07,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-01-10 21:41:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:07,021 INFO L225 Difference]: With dead ends: 1233 [2022-01-10 21:41:07,021 INFO L226 Difference]: Without dead ends: 1033 [2022-01-10 21:41:07,022 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 21:41:07,022 INFO L933 BasicCegarLoop]: 1221 mSDtfsCounter, 243 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:07,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 2185 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-01-10 21:41:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1010. [2022-01-10 21:41:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 998 states have (on average 1.4208416833667334) internal successors, (1418), 1009 states have internal predecessors, (1418), 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 21:41:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1418 transitions. [2022-01-10 21:41:07,089 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1418 transitions. Word has length 27 [2022-01-10 21:41:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:07,089 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 1418 transitions. [2022-01-10 21:41:07,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 21:41:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1418 transitions. [2022-01-10 21:41:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 21:41:07,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:07,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:07,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:41:07,091 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1634574814, now seen corresponding path program 1 times [2022-01-10 21:41:07,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:07,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665717627] [2022-01-10 21:41:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:07,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:07,133 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 21:41:07,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:07,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665717627] [2022-01-10 21:41:07,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665717627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:07,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:07,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:07,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034638070] [2022-01-10 21:41:07,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:07,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:07,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:07,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:07,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:07,135 INFO L87 Difference]: Start difference. First operand 1010 states and 1418 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 21:41:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:07,416 INFO L93 Difference]: Finished difference Result 1209 states and 1688 transitions. [2022-01-10 21:41:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:07,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 30 [2022-01-10 21:41:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:07,420 INFO L225 Difference]: With dead ends: 1209 [2022-01-10 21:41:07,420 INFO L226 Difference]: Without dead ends: 1000 [2022-01-10 21:41:07,421 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 21:41:07,422 INFO L933 BasicCegarLoop]: 1208 mSDtfsCounter, 33 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:07,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 2175 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-01-10 21:41:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2022-01-10 21:41:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 991 states have (on average 1.415741675075681) internal successors, (1403), 999 states have internal predecessors, (1403), 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 21:41:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1403 transitions. [2022-01-10 21:41:07,507 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1403 transitions. Word has length 30 [2022-01-10 21:41:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:07,508 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1403 transitions. [2022-01-10 21:41:07,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 21:41:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1403 transitions. [2022-01-10 21:41:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 21:41:07,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:07,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:07,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:41:07,510 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1186815526, now seen corresponding path program 1 times [2022-01-10 21:41:07,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:07,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680225081] [2022-01-10 21:41:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:07,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:07,546 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 21:41:07,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:07,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680225081] [2022-01-10 21:41:07,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680225081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:07,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:07,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:07,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306147211] [2022-01-10 21:41:07,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:07,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:07,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:07,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:07,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:07,548 INFO L87 Difference]: Start difference. First operand 1000 states and 1403 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 21:41:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:07,863 INFO L93 Difference]: Finished difference Result 1186 states and 1638 transitions. [2022-01-10 21:41:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:07,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2022-01-10 21:41:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:07,868 INFO L225 Difference]: With dead ends: 1186 [2022-01-10 21:41:07,868 INFO L226 Difference]: Without dead ends: 1170 [2022-01-10 21:41:07,869 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 21:41:07,870 INFO L933 BasicCegarLoop]: 1186 mSDtfsCounter, 152 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:07,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 2156 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-01-10 21:41:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1059. [2022-01-10 21:41:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1050 states have (on average 1.398095238095238) internal successors, (1468), 1058 states have internal predecessors, (1468), 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 21:41:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1468 transitions. [2022-01-10 21:41:07,945 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1468 transitions. Word has length 31 [2022-01-10 21:41:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:07,945 INFO L470 AbstractCegarLoop]: Abstraction has 1059 states and 1468 transitions. [2022-01-10 21:41:07,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 21:41:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1468 transitions. [2022-01-10 21:41:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:41:07,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:07,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:07,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:41:07,948 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:07,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1628848061, now seen corresponding path program 1 times [2022-01-10 21:41:07,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297565899] [2022-01-10 21:41:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:07,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:07,990 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 21:41:07,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:07,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297565899] [2022-01-10 21:41:07,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297565899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:07,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:07,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:07,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65383982] [2022-01-10 21:41:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:07,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:07,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:07,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:07,992 INFO L87 Difference]: Start difference. First operand 1059 states and 1468 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 21:41:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:08,273 INFO L93 Difference]: Finished difference Result 1085 states and 1497 transitions. [2022-01-10 21:41:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:08,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2022-01-10 21:41:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:08,278 INFO L225 Difference]: With dead ends: 1085 [2022-01-10 21:41:08,278 INFO L226 Difference]: Without dead ends: 1080 [2022-01-10 21:41:08,278 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 21:41:08,279 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 43 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:08,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 2134 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-01-10 21:41:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1077. [2022-01-10 21:41:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1068 states have (on average 1.395131086142322) internal successors, (1490), 1076 states have internal predecessors, (1490), 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 21:41:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1490 transitions. [2022-01-10 21:41:08,351 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1490 transitions. Word has length 32 [2022-01-10 21:41:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:08,351 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1490 transitions. [2022-01-10 21:41:08,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 21:41:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1490 transitions. [2022-01-10 21:41:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:41:08,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:08,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:08,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:41:08,354 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1862434565, now seen corresponding path program 1 times [2022-01-10 21:41:08,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:08,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858775759] [2022-01-10 21:41:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:08,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:08,424 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 21:41:08,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:08,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858775759] [2022-01-10 21:41:08,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858775759] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:08,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:08,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:08,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920783499] [2022-01-10 21:41:08,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:08,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:08,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:08,426 INFO L87 Difference]: Start difference. First operand 1077 states and 1490 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 21:41:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:08,772 INFO L93 Difference]: Finished difference Result 1202 states and 1655 transitions. [2022-01-10 21:41:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2022-01-10 21:41:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:08,777 INFO L225 Difference]: With dead ends: 1202 [2022-01-10 21:41:08,777 INFO L226 Difference]: Without dead ends: 1190 [2022-01-10 21:41:08,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:08,779 INFO L933 BasicCegarLoop]: 1168 mSDtfsCounter, 1460 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:08,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1460 Valid, 2138 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-01-10 21:41:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1077. [2022-01-10 21:41:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1068 states have (on average 1.3932584269662922) internal successors, (1488), 1076 states have internal predecessors, (1488), 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 21:41:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1488 transitions. [2022-01-10 21:41:08,862 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1488 transitions. Word has length 32 [2022-01-10 21:41:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:08,862 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1488 transitions. [2022-01-10 21:41:08,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 21:41:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1488 transitions. [2022-01-10 21:41:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:08,865 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:08,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:08,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:41:08,865 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1044327868, now seen corresponding path program 1 times [2022-01-10 21:41:08,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:08,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400716017] [2022-01-10 21:41:08,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:08,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:08,912 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 21:41:08,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:08,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400716017] [2022-01-10 21:41:08,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400716017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:08,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:08,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:08,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598628280] [2022-01-10 21:41:08,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:08,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:08,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:08,914 INFO L87 Difference]: Start difference. First operand 1077 states and 1488 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:41:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:09,246 INFO L93 Difference]: Finished difference Result 1085 states and 1494 transitions. [2022-01-10 21:41:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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) Word has length 33 [2022-01-10 21:41:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:09,251 INFO L225 Difference]: With dead ends: 1085 [2022-01-10 21:41:09,251 INFO L226 Difference]: Without dead ends: 1080 [2022-01-10 21:41:09,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:09,252 INFO L933 BasicCegarLoop]: 1159 mSDtfsCounter, 1221 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:09,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1221 Valid, 2096 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-01-10 21:41:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1077. [2022-01-10 21:41:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1068 states have (on average 1.392322097378277) internal successors, (1487), 1076 states have internal predecessors, (1487), 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 21:41:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1487 transitions. [2022-01-10 21:41:09,353 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1487 transitions. Word has length 33 [2022-01-10 21:41:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:09,353 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1487 transitions. [2022-01-10 21:41:09,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:41:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1487 transitions. [2022-01-10 21:41:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:09,355 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:09,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:09,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:41:09,356 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1112256734, now seen corresponding path program 1 times [2022-01-10 21:41:09,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:09,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290454292] [2022-01-10 21:41:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:09,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:09,433 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 21:41:09,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:09,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290454292] [2022-01-10 21:41:09,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290454292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:09,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:09,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:09,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917487215] [2022-01-10 21:41:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:09,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:09,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:09,435 INFO L87 Difference]: Start difference. First operand 1077 states and 1487 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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 21:41:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:09,550 INFO L93 Difference]: Finished difference Result 1325 states and 1813 transitions. [2022-01-10 21:41:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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) Word has length 33 [2022-01-10 21:41:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:09,555 INFO L225 Difference]: With dead ends: 1325 [2022-01-10 21:41:09,555 INFO L226 Difference]: Without dead ends: 1186 [2022-01-10 21:41:09,556 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 21:41:09,556 INFO L933 BasicCegarLoop]: 1239 mSDtfsCounter, 178 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:09,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 2336 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-01-10 21:41:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1065. [2022-01-10 21:41:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1059 states have (on average 1.3871576959395657) internal successors, (1469), 1064 states have internal predecessors, (1469), 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 21:41:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1469 transitions. [2022-01-10 21:41:09,637 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1469 transitions. Word has length 33 [2022-01-10 21:41:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:09,637 INFO L470 AbstractCegarLoop]: Abstraction has 1065 states and 1469 transitions. [2022-01-10 21:41:09,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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 21:41:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1469 transitions. [2022-01-10 21:41:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:09,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:09,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:09,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:41:09,640 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1930725772, now seen corresponding path program 1 times [2022-01-10 21:41:09,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:09,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117284904] [2022-01-10 21:41:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:09,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:09,680 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 21:41:09,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117284904] [2022-01-10 21:41:09,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117284904] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:09,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:09,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:09,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149049544] [2022-01-10 21:41:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:09,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:09,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:09,682 INFO L87 Difference]: Start difference. First operand 1065 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:41:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:10,018 INFO L93 Difference]: Finished difference Result 1166 states and 1605 transitions. [2022-01-10 21:41:10,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:10,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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) Word has length 33 [2022-01-10 21:41:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:10,022 INFO L225 Difference]: With dead ends: 1166 [2022-01-10 21:41:10,023 INFO L226 Difference]: Without dead ends: 1161 [2022-01-10 21:41:10,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:10,024 INFO L933 BasicCegarLoop]: 1145 mSDtfsCounter, 1428 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:10,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1428 Valid, 2109 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-01-10 21:41:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1068. [2022-01-10 21:41:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1062 states have (on average 1.3860640301318268) internal successors, (1472), 1067 states have internal predecessors, (1472), 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 21:41:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1472 transitions. [2022-01-10 21:41:10,109 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1472 transitions. Word has length 33 [2022-01-10 21:41:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:10,109 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1472 transitions. [2022-01-10 21:41:10,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:41:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1472 transitions. [2022-01-10 21:41:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:10,111 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:10,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:10,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 21:41:10,111 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1930724747, now seen corresponding path program 1 times [2022-01-10 21:41:10,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:10,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971632911] [2022-01-10 21:41:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:10,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:10,179 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 21:41:10,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:10,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971632911] [2022-01-10 21:41:10,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971632911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:10,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:10,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:10,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115307532] [2022-01-10 21:41:10,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:10,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:10,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:10,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:10,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:10,180 INFO L87 Difference]: Start difference. First operand 1068 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:41:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:10,517 INFO L93 Difference]: Finished difference Result 1084 states and 1488 transitions. [2022-01-10 21:41:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:10,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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) Word has length 33 [2022-01-10 21:41:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:10,521 INFO L225 Difference]: With dead ends: 1084 [2022-01-10 21:41:10,522 INFO L226 Difference]: Without dead ends: 1037 [2022-01-10 21:41:10,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:10,523 INFO L933 BasicCegarLoop]: 1044 mSDtfsCounter, 1259 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:10,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1259 Valid, 1910 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-01-10 21:41:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2022-01-10 21:41:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1031 states have (on average 1.3889427740058196) internal successors, (1432), 1036 states have internal predecessors, (1432), 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 21:41:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1432 transitions. [2022-01-10 21:41:10,607 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1432 transitions. Word has length 33 [2022-01-10 21:41:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:10,608 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1432 transitions. [2022-01-10 21:41:10,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:41:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1432 transitions. [2022-01-10 21:41:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:10,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:10,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:10,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 21:41:10,610 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:10,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1398427461, now seen corresponding path program 1 times [2022-01-10 21:41:10,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:10,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152102626] [2022-01-10 21:41:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:10,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:10,666 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 21:41:10,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:10,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152102626] [2022-01-10 21:41:10,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152102626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:10,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:10,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:10,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944293516] [2022-01-10 21:41:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:10,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:10,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:10,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:10,668 INFO L87 Difference]: Start difference. First operand 1037 states and 1432 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:41:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:10,937 INFO L93 Difference]: Finished difference Result 1094 states and 1491 transitions. [2022-01-10 21:41:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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) Word has length 33 [2022-01-10 21:41:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:10,941 INFO L225 Difference]: With dead ends: 1094 [2022-01-10 21:41:10,941 INFO L226 Difference]: Without dead ends: 1028 [2022-01-10 21:41:10,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:10,942 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 1232 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:10,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1232 Valid, 1965 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-01-10 21:41:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2022-01-10 21:41:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1022 states have (on average 1.3747553816046967) internal successors, (1405), 1027 states have internal predecessors, (1405), 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 21:41:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1405 transitions. [2022-01-10 21:41:11,026 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1405 transitions. Word has length 33 [2022-01-10 21:41:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:11,026 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1405 transitions. [2022-01-10 21:41:11,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 21:41:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1405 transitions. [2022-01-10 21:41:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:11,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:11,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:11,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 21:41:11,029 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:11,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:11,029 INFO L85 PathProgramCache]: Analyzing trace with hash 306062822, now seen corresponding path program 1 times [2022-01-10 21:41:11,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:11,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965062871] [2022-01-10 21:41:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:11,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:11,065 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 21:41:11,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965062871] [2022-01-10 21:41:11,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965062871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:11,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:11,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:11,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389817056] [2022-01-10 21:41:11,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:11,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:11,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:11,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:11,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:11,067 INFO L87 Difference]: Start difference. First operand 1028 states and 1405 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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 21:41:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:11,327 INFO L93 Difference]: Finished difference Result 1061 states and 1436 transitions. [2022-01-10 21:41:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:11,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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) Word has length 33 [2022-01-10 21:41:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:11,330 INFO L225 Difference]: With dead ends: 1061 [2022-01-10 21:41:11,331 INFO L226 Difference]: Without dead ends: 1047 [2022-01-10 21:41:11,331 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 21:41:11,332 INFO L933 BasicCegarLoop]: 1153 mSDtfsCounter, 44 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:11,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 2090 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-01-10 21:41:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1038. [2022-01-10 21:41:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1032 states have (on average 1.372093023255814) internal successors, (1416), 1037 states have internal predecessors, (1416), 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 21:41:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1416 transitions. [2022-01-10 21:41:11,420 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1416 transitions. Word has length 33 [2022-01-10 21:41:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:11,421 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 1416 transitions. [2022-01-10 21:41:11,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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 21:41:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1416 transitions. [2022-01-10 21:41:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:11,423 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:11,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:11,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 21:41:11,423 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1070773469, now seen corresponding path program 1 times [2022-01-10 21:41:11,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:11,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945569291] [2022-01-10 21:41:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:11,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:11,459 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 21:41:11,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945569291] [2022-01-10 21:41:11,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945569291] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:11,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:11,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:11,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643248220] [2022-01-10 21:41:11,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:11,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:11,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:11,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:11,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:11,461 INFO L87 Difference]: Start difference. First operand 1038 states and 1416 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 21:41:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:11,561 INFO L93 Difference]: Finished difference Result 1140 states and 1553 transitions. [2022-01-10 21:41:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:11,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2022-01-10 21:41:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:11,565 INFO L225 Difference]: With dead ends: 1140 [2022-01-10 21:41:11,566 INFO L226 Difference]: Without dead ends: 1022 [2022-01-10 21:41:11,566 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 21:41:11,567 INFO L933 BasicCegarLoop]: 1136 mSDtfsCounter, 24 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:11,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 2242 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-01-10 21:41:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2022-01-10 21:41:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1016 states have (on average 1.3651574803149606) internal successors, (1387), 1021 states have internal predecessors, (1387), 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 21:41:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1387 transitions. [2022-01-10 21:41:11,659 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1387 transitions. Word has length 34 [2022-01-10 21:41:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:11,659 INFO L470 AbstractCegarLoop]: Abstraction has 1022 states and 1387 transitions. [2022-01-10 21:41:11,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 21:41:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1387 transitions. [2022-01-10 21:41:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:11,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:11,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:11,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 21:41:11,662 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash 899002683, now seen corresponding path program 1 times [2022-01-10 21:41:11,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:11,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341473536] [2022-01-10 21:41:11,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:11,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:11,704 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 21:41:11,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:11,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341473536] [2022-01-10 21:41:11,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341473536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:11,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:11,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:11,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126641153] [2022-01-10 21:41:11,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:11,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:11,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:11,706 INFO L87 Difference]: Start difference. First operand 1022 states and 1387 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 21:41:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:11,982 INFO L93 Difference]: Finished difference Result 1031 states and 1393 transitions. [2022-01-10 21:41:11,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:11,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-01-10 21:41:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:11,986 INFO L225 Difference]: With dead ends: 1031 [2022-01-10 21:41:11,986 INFO L226 Difference]: Without dead ends: 1028 [2022-01-10 21:41:11,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:11,987 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 1164 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:11,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1164 Valid, 2049 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-01-10 21:41:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2022-01-10 21:41:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1013 states have (on average 1.3642645607107602) internal successors, (1382), 1018 states have internal predecessors, (1382), 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 21:41:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1382 transitions. [2022-01-10 21:41:12,074 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1382 transitions. Word has length 34 [2022-01-10 21:41:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:12,074 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1382 transitions. [2022-01-10 21:41:12,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 21:41:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1382 transitions. [2022-01-10 21:41:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:12,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:12,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:12,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 21:41:12,077 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash 899003708, now seen corresponding path program 1 times [2022-01-10 21:41:12,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:12,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263509174] [2022-01-10 21:41:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:12,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:12,163 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 21:41:12,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:12,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263509174] [2022-01-10 21:41:12,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263509174] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:12,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:12,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:12,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647742175] [2022-01-10 21:41:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:12,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:12,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:12,164 INFO L87 Difference]: Start difference. First operand 1019 states and 1382 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 21:41:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:12,392 INFO L93 Difference]: Finished difference Result 1037 states and 1400 transitions. [2022-01-10 21:41:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 34 [2022-01-10 21:41:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:12,396 INFO L225 Difference]: With dead ends: 1037 [2022-01-10 21:41:12,396 INFO L226 Difference]: Without dead ends: 1018 [2022-01-10 21:41:12,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 21:41:12,397 INFO L933 BasicCegarLoop]: 1140 mSDtfsCounter, 52 mSDsluCounter, 4463 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 5603 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:12,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 5603 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-01-10 21:41:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2022-01-10 21:41:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1012 states have (on average 1.3636363636363635) internal successors, (1380), 1017 states have internal predecessors, (1380), 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 21:41:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1380 transitions. [2022-01-10 21:41:12,492 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1380 transitions. Word has length 34 [2022-01-10 21:41:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:12,492 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 1380 transitions. [2022-01-10 21:41:12,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 21:41:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1380 transitions. [2022-01-10 21:41:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:12,494 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:12,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:12,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 21:41:12,495 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash 477046445, now seen corresponding path program 1 times [2022-01-10 21:41:12,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838375930] [2022-01-10 21:41:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:12,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:12,554 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 21:41:12,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:12,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838375930] [2022-01-10 21:41:12,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838375930] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:12,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:12,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:12,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522310310] [2022-01-10 21:41:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:12,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:12,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:12,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:12,556 INFO L87 Difference]: Start difference. First operand 1018 states and 1380 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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 21:41:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:12,848 INFO L93 Difference]: Finished difference Result 1040 states and 1403 transitions. [2022-01-10 21:41:12,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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) Word has length 35 [2022-01-10 21:41:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:12,863 INFO L225 Difference]: With dead ends: 1040 [2022-01-10 21:41:12,863 INFO L226 Difference]: Without dead ends: 1006 [2022-01-10 21:41:12,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 21:41:12,865 INFO L933 BasicCegarLoop]: 1123 mSDtfsCounter, 76 mSDsluCounter, 5531 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 6654 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:12,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 6654 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2022-01-10 21:41:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2022-01-10 21:41:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1000 states have (on average 1.36) internal successors, (1360), 1005 states have internal predecessors, (1360), 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 21:41:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1360 transitions. [2022-01-10 21:41:12,963 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1360 transitions. Word has length 35 [2022-01-10 21:41:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:12,963 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1360 transitions. [2022-01-10 21:41:12,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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 21:41:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1360 transitions. [2022-01-10 21:41:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:12,966 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:12,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:12,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 21:41:12,966 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2045667345, now seen corresponding path program 1 times [2022-01-10 21:41:12,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:12,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105874354] [2022-01-10 21:41:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:12,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:13,063 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 21:41:13,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:13,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105874354] [2022-01-10 21:41:13,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105874354] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:13,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:13,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:13,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49167782] [2022-01-10 21:41:13,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:13,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:13,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:13,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:13,067 INFO L87 Difference]: Start difference. First operand 1006 states and 1360 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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 21:41:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:13,425 INFO L93 Difference]: Finished difference Result 1049 states and 1402 transitions. [2022-01-10 21:41:13,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:13,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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) Word has length 35 [2022-01-10 21:41:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:13,428 INFO L225 Difference]: With dead ends: 1049 [2022-01-10 21:41:13,428 INFO L226 Difference]: Without dead ends: 1005 [2022-01-10 21:41:13,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 21:41:13,431 INFO L933 BasicCegarLoop]: 1105 mSDtfsCounter, 409 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 6189 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:13,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 6189 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2022-01-10 21:41:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 974. [2022-01-10 21:41:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 968 states have (on average 1.3636363636363635) internal successors, (1320), 973 states have internal predecessors, (1320), 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 21:41:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1320 transitions. [2022-01-10 21:41:13,507 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1320 transitions. Word has length 35 [2022-01-10 21:41:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:13,507 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1320 transitions. [2022-01-10 21:41:13,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 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 21:41:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1320 transitions. [2022-01-10 21:41:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:13,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:13,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:13,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 21:41:13,509 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:13,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:13,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2048855116, now seen corresponding path program 1 times [2022-01-10 21:41:13,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:13,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542324151] [2022-01-10 21:41:13,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:13,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:13,596 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 21:41:13,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:13,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542324151] [2022-01-10 21:41:13,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542324151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:13,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:13,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:41:13,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27164743] [2022-01-10 21:41:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:13,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:41:13,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:41:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:41:13,598 INFO L87 Difference]: Start difference. First operand 974 states and 1320 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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 21:41:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:13,787 INFO L93 Difference]: Finished difference Result 986 states and 1332 transitions. [2022-01-10 21:41:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:41:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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) Word has length 35 [2022-01-10 21:41:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:13,790 INFO L225 Difference]: With dead ends: 986 [2022-01-10 21:41:13,790 INFO L226 Difference]: Without dead ends: 958 [2022-01-10 21:41:13,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:13,791 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 38 mSDsluCounter, 4201 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 5281 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:13,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 5281 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-01-10 21:41:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2022-01-10 21:41:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 952 states have (on average 1.3676470588235294) internal successors, (1302), 957 states have internal predecessors, (1302), 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 21:41:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1302 transitions. [2022-01-10 21:41:13,874 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1302 transitions. Word has length 35 [2022-01-10 21:41:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:13,874 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 1302 transitions. [2022-01-10 21:41:13,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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 21:41:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1302 transitions. [2022-01-10 21:41:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:13,876 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:13,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:13,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 21:41:13,876 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1958031176, now seen corresponding path program 1 times [2022-01-10 21:41:13,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:13,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593671208] [2022-01-10 21:41:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:13,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:13,959 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 21:41:13,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:13,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593671208] [2022-01-10 21:41:13,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593671208] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:13,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:13,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 21:41:13,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621803430] [2022-01-10 21:41:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:13,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:41:13,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:13,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:41:13,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:13,961 INFO L87 Difference]: Start difference. First operand 958 states and 1302 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 21:41:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:14,240 INFO L93 Difference]: Finished difference Result 1003 states and 1347 transitions. [2022-01-10 21:41:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:14,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 36 [2022-01-10 21:41:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:14,242 INFO L225 Difference]: With dead ends: 1003 [2022-01-10 21:41:14,242 INFO L226 Difference]: Without dead ends: 954 [2022-01-10 21:41:14,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 21:41:14,243 INFO L933 BasicCegarLoop]: 1020 mSDtfsCounter, 201 mSDsluCounter, 7114 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 8134 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:14,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 8134 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-01-10 21:41:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 938. [2022-01-10 21:41:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 932 states have (on average 1.363733905579399) internal successors, (1271), 937 states have internal predecessors, (1271), 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 21:41:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1271 transitions. [2022-01-10 21:41:14,331 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1271 transitions. Word has length 36 [2022-01-10 21:41:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:14,331 INFO L470 AbstractCegarLoop]: Abstraction has 938 states and 1271 transitions. [2022-01-10 21:41:14,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 21:41:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1271 transitions. [2022-01-10 21:41:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:14,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:14,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:14,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 21:41:14,333 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:14,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1549206951, now seen corresponding path program 1 times [2022-01-10 21:41:14,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:14,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530718757] [2022-01-10 21:41:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:14,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:14,405 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 21:41:14,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:14,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530718757] [2022-01-10 21:41:14,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530718757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:14,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:14,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 21:41:14,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712863889] [2022-01-10 21:41:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:14,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:41:14,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:14,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:41:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:14,407 INFO L87 Difference]: Start difference. First operand 938 states and 1271 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 21:41:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:14,643 INFO L93 Difference]: Finished difference Result 961 states and 1294 transitions. [2022-01-10 21:41:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:14,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 36 [2022-01-10 21:41:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:14,645 INFO L225 Difference]: With dead ends: 961 [2022-01-10 21:41:14,645 INFO L226 Difference]: Without dead ends: 938 [2022-01-10 21:41:14,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 21:41:14,646 INFO L933 BasicCegarLoop]: 1020 mSDtfsCounter, 98 mSDsluCounter, 7105 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 8125 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:14,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 8125 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-01-10 21:41:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2022-01-10 21:41:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 932 states have (on average 1.3605150214592274) internal successors, (1268), 937 states have internal predecessors, (1268), 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 21:41:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1268 transitions. [2022-01-10 21:41:14,730 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1268 transitions. Word has length 36 [2022-01-10 21:41:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:14,730 INFO L470 AbstractCegarLoop]: Abstraction has 938 states and 1268 transitions. [2022-01-10 21:41:14,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 21:41:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1268 transitions. [2022-01-10 21:41:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:14,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:14,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:14,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 21:41:14,733 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 723048970, now seen corresponding path program 1 times [2022-01-10 21:41:14,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578785072] [2022-01-10 21:41:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:14,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:14,769 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 21:41:14,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:14,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578785072] [2022-01-10 21:41:14,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578785072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:14,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:14,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:14,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003248298] [2022-01-10 21:41:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:14,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:14,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:14,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:14,770 INFO L87 Difference]: Start difference. First operand 938 states and 1268 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 21:41:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:14,904 INFO L93 Difference]: Finished difference Result 1313 states and 1763 transitions. [2022-01-10 21:41:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:14,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-01-10 21:41:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:14,907 INFO L225 Difference]: With dead ends: 1313 [2022-01-10 21:41:14,907 INFO L226 Difference]: Without dead ends: 1136 [2022-01-10 21:41:14,908 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 21:41:14,909 INFO L933 BasicCegarLoop]: 1214 mSDtfsCounter, 433 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:14,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 1989 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-01-10 21:41:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 938. [2022-01-10 21:41:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 932 states have (on average 1.349785407725322) internal successors, (1258), 937 states have internal predecessors, (1258), 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 21:41:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1258 transitions. [2022-01-10 21:41:15,013 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1258 transitions. Word has length 36 [2022-01-10 21:41:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:15,014 INFO L470 AbstractCegarLoop]: Abstraction has 938 states and 1258 transitions. [2022-01-10 21:41:15,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 21:41:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1258 transitions. [2022-01-10 21:41:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:15,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:15,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:15,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 21:41:15,016 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 934399883, now seen corresponding path program 1 times [2022-01-10 21:41:15,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:15,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489439959] [2022-01-10 21:41:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:15,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:15,076 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 21:41:15,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:15,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489439959] [2022-01-10 21:41:15,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489439959] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:15,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:15,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:15,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648719242] [2022-01-10 21:41:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:15,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:15,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:15,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:15,078 INFO L87 Difference]: Start difference. First operand 938 states and 1258 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 21:41:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:15,362 INFO L93 Difference]: Finished difference Result 1116 states and 1483 transitions. [2022-01-10 21:41:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2022-01-10 21:41:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:15,364 INFO L225 Difference]: With dead ends: 1116 [2022-01-10 21:41:15,364 INFO L226 Difference]: Without dead ends: 1077 [2022-01-10 21:41:15,365 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 21:41:15,365 INFO L933 BasicCegarLoop]: 1033 mSDtfsCounter, 238 mSDsluCounter, 6162 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 7195 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:15,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 7195 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2022-01-10 21:41:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 938. [2022-01-10 21:41:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 932 states have (on average 1.3487124463519313) internal successors, (1257), 937 states have internal predecessors, (1257), 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 21:41:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1257 transitions. [2022-01-10 21:41:15,448 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1257 transitions. Word has length 36 [2022-01-10 21:41:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:15,448 INFO L470 AbstractCegarLoop]: Abstraction has 938 states and 1257 transitions. [2022-01-10 21:41:15,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 21:41:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1257 transitions. [2022-01-10 21:41:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 21:41:15,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:15,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:15,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 21:41:15,451 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:15,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash -909215267, now seen corresponding path program 1 times [2022-01-10 21:41:15,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:15,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831434542] [2022-01-10 21:41:15,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:15,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:15,540 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 21:41:15,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:15,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831434542] [2022-01-10 21:41:15,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831434542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:15,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:15,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:15,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686376872] [2022-01-10 21:41:15,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:15,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:15,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:15,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:15,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:15,541 INFO L87 Difference]: Start difference. First operand 938 states and 1257 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 21:41:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:15,893 INFO L93 Difference]: Finished difference Result 971 states and 1289 transitions. [2022-01-10 21:41:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:15,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2022-01-10 21:41:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:15,902 INFO L225 Difference]: With dead ends: 971 [2022-01-10 21:41:15,902 INFO L226 Difference]: Without dead ends: 941 [2022-01-10 21:41:15,903 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 21:41:15,904 INFO L933 BasicCegarLoop]: 1006 mSDtfsCounter, 412 mSDsluCounter, 5598 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 6604 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:15,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 6604 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:15,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-01-10 21:41:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 922. [2022-01-10 21:41:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 916 states have (on average 1.3504366812227073) internal successors, (1237), 921 states have internal predecessors, (1237), 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 21:41:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1237 transitions. [2022-01-10 21:41:15,990 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1237 transitions. Word has length 37 [2022-01-10 21:41:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:15,990 INFO L470 AbstractCegarLoop]: Abstraction has 922 states and 1237 transitions. [2022-01-10 21:41:15,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 21:41:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1237 transitions. [2022-01-10 21:41:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:41:15,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:15,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:15,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 21:41:15,993 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:15,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1094835553, now seen corresponding path program 1 times [2022-01-10 21:41:15,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:15,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029562133] [2022-01-10 21:41:15,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:15,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:16,034 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 21:41:16,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:16,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029562133] [2022-01-10 21:41:16,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029562133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:16,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:16,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:16,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897740071] [2022-01-10 21:41:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:16,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:16,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:16,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:16,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:16,035 INFO L87 Difference]: Start difference. First operand 922 states and 1237 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 21:41:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:16,191 INFO L93 Difference]: Finished difference Result 1153 states and 1509 transitions. [2022-01-10 21:41:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:16,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2022-01-10 21:41:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:16,193 INFO L225 Difference]: With dead ends: 1153 [2022-01-10 21:41:16,193 INFO L226 Difference]: Without dead ends: 1130 [2022-01-10 21:41:16,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:16,194 INFO L933 BasicCegarLoop]: 1035 mSDtfsCounter, 295 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:16,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 2999 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2022-01-10 21:41:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 924. [2022-01-10 21:41:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 918 states have (on average 1.3496732026143792) internal successors, (1239), 923 states have internal predecessors, (1239), 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 21:41:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1239 transitions. [2022-01-10 21:41:16,284 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1239 transitions. Word has length 38 [2022-01-10 21:41:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:16,284 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1239 transitions. [2022-01-10 21:41:16,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 21:41:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1239 transitions. [2022-01-10 21:41:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:41:16,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:16,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:16,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 21:41:16,286 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 647583552, now seen corresponding path program 1 times [2022-01-10 21:41:16,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:16,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390006017] [2022-01-10 21:41:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:16,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:16,327 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 21:41:16,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390006017] [2022-01-10 21:41:16,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390006017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:16,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:16,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:16,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445261342] [2022-01-10 21:41:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:16,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:16,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:16,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:16,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:16,330 INFO L87 Difference]: Start difference. First operand 924 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 21:41:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:16,516 INFO L93 Difference]: Finished difference Result 1145 states and 1502 transitions. [2022-01-10 21:41:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:16,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2022-01-10 21:41:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:16,519 INFO L225 Difference]: With dead ends: 1145 [2022-01-10 21:41:16,519 INFO L226 Difference]: Without dead ends: 1123 [2022-01-10 21:41:16,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:16,521 INFO L933 BasicCegarLoop]: 1051 mSDtfsCounter, 311 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 3024 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:16,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 3024 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-01-10 21:41:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 926. [2022-01-10 21:41:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 920 states have (on average 1.3489130434782608) internal successors, (1241), 925 states have internal predecessors, (1241), 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 21:41:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1241 transitions. [2022-01-10 21:41:16,621 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1241 transitions. Word has length 38 [2022-01-10 21:41:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:16,621 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1241 transitions. [2022-01-10 21:41:16,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 21:41:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1241 transitions. [2022-01-10 21:41:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:41:16,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:16,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:16,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 21:41:16,623 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash -620171654, now seen corresponding path program 1 times [2022-01-10 21:41:16,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917608432] [2022-01-10 21:41:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:16,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:16,655 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 21:41:16,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917608432] [2022-01-10 21:41:16,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917608432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:16,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:16,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:16,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82945333] [2022-01-10 21:41:16,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:16,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:16,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:16,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:16,657 INFO L87 Difference]: Start difference. First operand 926 states and 1241 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 21:41:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:16,768 INFO L93 Difference]: Finished difference Result 1136 states and 1515 transitions. [2022-01-10 21:41:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:16,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-01-10 21:41:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:16,770 INFO L225 Difference]: With dead ends: 1136 [2022-01-10 21:41:16,770 INFO L226 Difference]: Without dead ends: 799 [2022-01-10 21:41:16,773 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 21:41:16,777 INFO L933 BasicCegarLoop]: 787 mSDtfsCounter, 198 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:16,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 1373 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-01-10 21:41:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 736. [2022-01-10 21:41:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 730 states have (on average 1.3397260273972602) internal successors, (978), 735 states have internal predecessors, (978), 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 21:41:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 978 transitions. [2022-01-10 21:41:16,843 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 978 transitions. Word has length 38 [2022-01-10 21:41:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:16,843 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 978 transitions. [2022-01-10 21:41:16,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 21:41:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 978 transitions. [2022-01-10 21:41:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:41:16,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:16,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:16,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 21:41:16,845 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1427164059, now seen corresponding path program 1 times [2022-01-10 21:41:16,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:16,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23943030] [2022-01-10 21:41:16,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:16,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:16,948 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 21:41:16,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:16,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23943030] [2022-01-10 21:41:16,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23943030] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:16,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:16,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 21:41:16,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415646667] [2022-01-10 21:41:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:16,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:41:16,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:41:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:16,950 INFO L87 Difference]: Start difference. First operand 736 states and 978 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 21:41:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:17,323 INFO L93 Difference]: Finished difference Result 769 states and 1010 transitions. [2022-01-10 21:41:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:17,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2022-01-10 21:41:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:17,324 INFO L225 Difference]: With dead ends: 769 [2022-01-10 21:41:17,325 INFO L226 Difference]: Without dead ends: 737 [2022-01-10 21:41:17,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 21:41:17,325 INFO L933 BasicCegarLoop]: 739 mSDtfsCounter, 391 mSDsluCounter, 4766 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 5505 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:17,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 5505 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-01-10 21:41:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 718. [2022-01-10 21:41:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 712 states have (on average 1.3426966292134832) internal successors, (956), 717 states have internal predecessors, (956), 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 21:41:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 956 transitions. [2022-01-10 21:41:17,403 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 956 transitions. Word has length 38 [2022-01-10 21:41:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:17,403 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 956 transitions. [2022-01-10 21:41:17,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 21:41:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 956 transitions. [2022-01-10 21:41:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 21:41:17,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:17,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:17,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 21:41:17,405 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1137985366, now seen corresponding path program 1 times [2022-01-10 21:41:17,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:17,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841889571] [2022-01-10 21:41:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:17,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:17,443 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 21:41:17,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:17,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841889571] [2022-01-10 21:41:17,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841889571] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:17,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:17,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:17,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272175835] [2022-01-10 21:41:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:17,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:17,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:17,445 INFO L87 Difference]: Start difference. First operand 718 states and 956 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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 21:41:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:17,580 INFO L93 Difference]: Finished difference Result 915 states and 1180 transitions. [2022-01-10 21:41:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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) Word has length 39 [2022-01-10 21:41:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:17,582 INFO L225 Difference]: With dead ends: 915 [2022-01-10 21:41:17,582 INFO L226 Difference]: Without dead ends: 892 [2022-01-10 21:41:17,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:17,583 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 237 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:17,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 2256 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-01-10 21:41:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 720. [2022-01-10 21:41:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 714 states have (on average 1.341736694677871) internal successors, (958), 719 states have internal predecessors, (958), 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 21:41:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 958 transitions. [2022-01-10 21:41:17,653 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 958 transitions. Word has length 39 [2022-01-10 21:41:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:17,653 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 958 transitions. [2022-01-10 21:41:17,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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 21:41:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 958 transitions. [2022-01-10 21:41:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 21:41:17,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:17,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:17,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 21:41:17,654 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:17,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash -601014509, now seen corresponding path program 1 times [2022-01-10 21:41:17,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:17,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283919160] [2022-01-10 21:41:17,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:17,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:17,752 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 21:41:17,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:17,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283919160] [2022-01-10 21:41:17,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283919160] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:17,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:17,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 21:41:17,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662946323] [2022-01-10 21:41:17,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:17,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:41:17,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:17,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:41:17,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:17,754 INFO L87 Difference]: Start difference. First operand 720 states and 958 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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 21:41:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:17,969 INFO L93 Difference]: Finished difference Result 743 states and 981 transitions. [2022-01-10 21:41:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:17,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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) Word has length 39 [2022-01-10 21:41:17,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:17,971 INFO L225 Difference]: With dead ends: 743 [2022-01-10 21:41:17,971 INFO L226 Difference]: Without dead ends: 719 [2022-01-10 21:41:17,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 21:41:17,972 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 98 mSDsluCounter, 4982 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 5698 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:17,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 5698 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-01-10 21:41:18,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2022-01-10 21:41:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 713 states have (on average 1.335203366058906) internal successors, (952), 718 states have internal predecessors, (952), 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 21:41:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 952 transitions. [2022-01-10 21:41:18,041 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 952 transitions. Word has length 39 [2022-01-10 21:41:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:18,042 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 952 transitions. [2022-01-10 21:41:18,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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 21:41:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 952 transitions. [2022-01-10 21:41:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 21:41:18,043 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:18,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:18,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 21:41:18,043 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:18,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1575789386, now seen corresponding path program 1 times [2022-01-10 21:41:18,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:18,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114756188] [2022-01-10 21:41:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:18,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:18,098 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 21:41:18,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114756188] [2022-01-10 21:41:18,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114756188] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:18,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:18,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:18,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30930565] [2022-01-10 21:41:18,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:18,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:18,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:18,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:18,101 INFO L87 Difference]: Start difference. First operand 719 states and 952 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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 21:41:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:18,312 INFO L93 Difference]: Finished difference Result 741 states and 975 transitions. [2022-01-10 21:41:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:18,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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) Word has length 39 [2022-01-10 21:41:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:18,314 INFO L225 Difference]: With dead ends: 741 [2022-01-10 21:41:18,314 INFO L226 Difference]: Without dead ends: 718 [2022-01-10 21:41:18,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 21:41:18,314 INFO L933 BasicCegarLoop]: 711 mSDtfsCounter, 61 mSDsluCounter, 3488 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 4199 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:18,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 4199 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-01-10 21:41:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2022-01-10 21:41:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 712 states have (on average 1.327247191011236) internal successors, (945), 717 states have internal predecessors, (945), 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 21:41:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 945 transitions. [2022-01-10 21:41:18,382 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 945 transitions. Word has length 39 [2022-01-10 21:41:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:18,383 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 945 transitions. [2022-01-10 21:41:18,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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 21:41:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 945 transitions. [2022-01-10 21:41:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 21:41:18,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:18,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:18,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 21:41:18,384 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1883712859, now seen corresponding path program 1 times [2022-01-10 21:41:18,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:18,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073196605] [2022-01-10 21:41:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:18,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:18,496 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 21:41:18,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:18,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073196605] [2022-01-10 21:41:18,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073196605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:18,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:18,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 21:41:18,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790580275] [2022-01-10 21:41:18,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:18,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:41:18,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:41:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:18,499 INFO L87 Difference]: Start difference. First operand 718 states and 945 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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 21:41:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:18,931 INFO L93 Difference]: Finished difference Result 754 states and 980 transitions. [2022-01-10 21:41:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 21:41:18,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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) Word has length 39 [2022-01-10 21:41:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:18,933 INFO L225 Difference]: With dead ends: 754 [2022-01-10 21:41:18,933 INFO L226 Difference]: Without dead ends: 701 [2022-01-10 21:41:18,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-01-10 21:41:18,934 INFO L933 BasicCegarLoop]: 705 mSDtfsCounter, 508 mSDsluCounter, 4514 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 5219 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:18,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 5219 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-01-10 21:41:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 682. [2022-01-10 21:41:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 676 states have (on average 1.3254437869822486) internal successors, (896), 681 states have internal predecessors, (896), 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 21:41:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 896 transitions. [2022-01-10 21:41:19,004 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 896 transitions. Word has length 39 [2022-01-10 21:41:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:19,004 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 896 transitions. [2022-01-10 21:41:19,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 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 21:41:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 896 transitions. [2022-01-10 21:41:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 21:41:19,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:19,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:19,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 21:41:19,005 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1345243274, now seen corresponding path program 1 times [2022-01-10 21:41:19,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:19,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633937927] [2022-01-10 21:41:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:19,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:19,045 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 21:41:19,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:19,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633937927] [2022-01-10 21:41:19,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633937927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:19,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:19,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:19,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579116155] [2022-01-10 21:41:19,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:19,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:19,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:19,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:19,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:19,046 INFO L87 Difference]: Start difference. First operand 682 states and 896 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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 21:41:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:19,170 INFO L93 Difference]: Finished difference Result 719 states and 933 transitions. [2022-01-10 21:41:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:19,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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) Word has length 40 [2022-01-10 21:41:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:19,172 INFO L225 Difference]: With dead ends: 719 [2022-01-10 21:41:19,172 INFO L226 Difference]: Without dead ends: 699 [2022-01-10 21:41:19,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:19,172 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 21 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:19,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1323 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-01-10 21:41:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 682. [2022-01-10 21:41:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 676 states have (on average 1.3239644970414202) internal successors, (895), 681 states have internal predecessors, (895), 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 21:41:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 895 transitions. [2022-01-10 21:41:19,238 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 895 transitions. Word has length 40 [2022-01-10 21:41:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:19,239 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 895 transitions. [2022-01-10 21:41:19,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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 21:41:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 895 transitions. [2022-01-10 21:41:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 21:41:19,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:19,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:19,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 21:41:19,240 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:19,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash 500771403, now seen corresponding path program 1 times [2022-01-10 21:41:19,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:19,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991501466] [2022-01-10 21:41:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:19,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:19,312 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 21:41:19,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:19,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991501466] [2022-01-10 21:41:19,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991501466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:19,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:19,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:19,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072414644] [2022-01-10 21:41:19,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:19,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:19,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:19,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:19,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:19,314 INFO L87 Difference]: Start difference. First operand 682 states and 895 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 21:41:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:19,496 INFO L93 Difference]: Finished difference Result 708 states and 925 transitions. [2022-01-10 21:41:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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) Word has length 40 [2022-01-10 21:41:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:19,498 INFO L225 Difference]: With dead ends: 708 [2022-01-10 21:41:19,498 INFO L226 Difference]: Without dead ends: 674 [2022-01-10 21:41:19,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 21:41:19,499 INFO L933 BasicCegarLoop]: 686 mSDtfsCounter, 78 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 4047 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:19,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 4047 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-01-10 21:41:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-01-10 21:41:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 668 states have (on average 1.3203592814371257) internal successors, (882), 673 states have internal predecessors, (882), 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 21:41:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 882 transitions. [2022-01-10 21:41:19,566 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 882 transitions. Word has length 40 [2022-01-10 21:41:19,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:19,566 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 882 transitions. [2022-01-10 21:41:19,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 21:41:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 882 transitions. [2022-01-10 21:41:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 21:41:19,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:19,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:19,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 21:41:19,568 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:19,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:19,568 INFO L85 PathProgramCache]: Analyzing trace with hash 553791751, now seen corresponding path program 1 times [2022-01-10 21:41:19,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:19,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938575675] [2022-01-10 21:41:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:19,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:19,624 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 21:41:19,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:19,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938575675] [2022-01-10 21:41:19,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938575675] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:19,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:19,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:19,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870041339] [2022-01-10 21:41:19,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:19,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:19,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:19,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:19,628 INFO L87 Difference]: Start difference. First operand 674 states and 882 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 21:41:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:19,788 INFO L93 Difference]: Finished difference Result 691 states and 899 transitions. [2022-01-10 21:41:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:19,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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) Word has length 40 [2022-01-10 21:41:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:19,790 INFO L225 Difference]: With dead ends: 691 [2022-01-10 21:41:19,790 INFO L226 Difference]: Without dead ends: 666 [2022-01-10 21:41:19,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 21:41:19,791 INFO L933 BasicCegarLoop]: 670 mSDtfsCounter, 66 mSDsluCounter, 3293 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 3963 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:19,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 3963 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-01-10 21:41:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2022-01-10 21:41:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 660 states have (on average 1.3181818181818181) internal successors, (870), 665 states have internal predecessors, (870), 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 21:41:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 870 transitions. [2022-01-10 21:41:19,860 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 870 transitions. Word has length 40 [2022-01-10 21:41:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:19,860 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 870 transitions. [2022-01-10 21:41:19,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 21:41:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 870 transitions. [2022-01-10 21:41:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 21:41:19,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:19,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:19,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 21:41:19,861 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash 427816101, now seen corresponding path program 1 times [2022-01-10 21:41:19,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:19,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629919189] [2022-01-10 21:41:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:19,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:19,903 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 21:41:19,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:19,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629919189] [2022-01-10 21:41:19,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629919189] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:19,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:19,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:19,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563743518] [2022-01-10 21:41:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:19,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:19,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:19,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:19,905 INFO L87 Difference]: Start difference. First operand 666 states and 870 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 21:41:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:20,033 INFO L93 Difference]: Finished difference Result 757 states and 967 transitions. [2022-01-10 21:41:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:20,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2022-01-10 21:41:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:20,035 INFO L225 Difference]: With dead ends: 757 [2022-01-10 21:41:20,035 INFO L226 Difference]: Without dead ends: 736 [2022-01-10 21:41:20,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:20,036 INFO L933 BasicCegarLoop]: 690 mSDtfsCounter, 260 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:20,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 2488 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-01-10 21:41:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 673. [2022-01-10 21:41:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 667 states have (on average 1.3163418290854574) internal successors, (878), 672 states have internal predecessors, (878), 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 21:41:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 878 transitions. [2022-01-10 21:41:20,121 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 878 transitions. Word has length 41 [2022-01-10 21:41:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:20,121 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 878 transitions. [2022-01-10 21:41:20,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 21:41:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 878 transitions. [2022-01-10 21:41:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 21:41:20,122 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:20,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:20,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 21:41:20,122 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash -738623879, now seen corresponding path program 1 times [2022-01-10 21:41:20,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:20,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397916775] [2022-01-10 21:41:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:20,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:20,225 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 21:41:20,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:20,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397916775] [2022-01-10 21:41:20,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397916775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:20,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:20,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:20,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712499429] [2022-01-10 21:41:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:20,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:20,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:20,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:20,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:20,226 INFO L87 Difference]: Start difference. First operand 673 states and 878 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 21:41:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:20,377 INFO L93 Difference]: Finished difference Result 861 states and 1110 transitions. [2022-01-10 21:41:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:41:20,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2022-01-10 21:41:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:20,379 INFO L225 Difference]: With dead ends: 861 [2022-01-10 21:41:20,379 INFO L226 Difference]: Without dead ends: 726 [2022-01-10 21:41:20,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:20,380 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 486 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:20,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 2369 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-01-10 21:41:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 659. [2022-01-10 21:41:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 653 states have (on average 1.310872894333844) internal successors, (856), 658 states have internal predecessors, (856), 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 21:41:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 856 transitions. [2022-01-10 21:41:20,461 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 856 transitions. Word has length 41 [2022-01-10 21:41:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:20,463 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 856 transitions. [2022-01-10 21:41:20,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 21:41:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 856 transitions. [2022-01-10 21:41:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 21:41:20,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:20,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:20,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 21:41:20,464 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:20,465 INFO L85 PathProgramCache]: Analyzing trace with hash -364041053, now seen corresponding path program 1 times [2022-01-10 21:41:20,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:20,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701711228] [2022-01-10 21:41:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:20,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:20,541 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 21:41:20,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:20,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701711228] [2022-01-10 21:41:20,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701711228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:20,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:20,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:20,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071978125] [2022-01-10 21:41:20,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:20,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:20,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:20,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:20,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:20,543 INFO L87 Difference]: Start difference. First operand 659 states and 856 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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 21:41:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:20,747 INFO L93 Difference]: Finished difference Result 696 states and 893 transitions. [2022-01-10 21:41:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:20,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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) Word has length 42 [2022-01-10 21:41:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:20,749 INFO L225 Difference]: With dead ends: 696 [2022-01-10 21:41:20,749 INFO L226 Difference]: Without dead ends: 676 [2022-01-10 21:41:20,749 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 21:41:20,750 INFO L933 BasicCegarLoop]: 656 mSDtfsCounter, 100 mSDsluCounter, 3855 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:20,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 4511 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-01-10 21:41:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 659. [2022-01-10 21:41:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 653 states have (on average 1.3093415007656968) internal successors, (855), 658 states have internal predecessors, (855), 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 21:41:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 855 transitions. [2022-01-10 21:41:20,816 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 855 transitions. Word has length 42 [2022-01-10 21:41:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:20,816 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 855 transitions. [2022-01-10 21:41:20,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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 21:41:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 855 transitions. [2022-01-10 21:41:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 21:41:20,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:20,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:20,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-10 21:41:20,818 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1208512924, now seen corresponding path program 1 times [2022-01-10 21:41:20,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:20,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630719014] [2022-01-10 21:41:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:20,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:20,887 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 21:41:20,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:20,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630719014] [2022-01-10 21:41:20,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630719014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:20,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:20,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:20,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512832472] [2022-01-10 21:41:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:20,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:20,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:20,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:20,889 INFO L87 Difference]: Start difference. First operand 659 states and 855 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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 21:41:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:21,158 INFO L93 Difference]: Finished difference Result 771 states and 984 transitions. [2022-01-10 21:41:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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) Word has length 42 [2022-01-10 21:41:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:21,159 INFO L225 Difference]: With dead ends: 771 [2022-01-10 21:41:21,160 INFO L226 Difference]: Without dead ends: 631 [2022-01-10 21:41:21,160 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 21:41:21,160 INFO L933 BasicCegarLoop]: 637 mSDtfsCounter, 249 mSDsluCounter, 3679 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 4316 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:21,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 4316 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-01-10 21:41:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 574. [2022-01-10 21:41:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 568 states have (on average 1.2992957746478873) internal successors, (738), 573 states have internal predecessors, (738), 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 21:41:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 738 transitions. [2022-01-10 21:41:21,238 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 738 transitions. Word has length 42 [2022-01-10 21:41:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:21,239 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 738 transitions. [2022-01-10 21:41:21,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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 21:41:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 738 transitions. [2022-01-10 21:41:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 21:41:21,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:21,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:21,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-10 21:41:21,240 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:21,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash -90950283, now seen corresponding path program 1 times [2022-01-10 21:41:21,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:21,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84247614] [2022-01-10 21:41:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:21,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:21,320 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 21:41:21,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:21,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84247614] [2022-01-10 21:41:21,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84247614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:21,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:21,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 21:41:21,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411287925] [2022-01-10 21:41:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:21,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 21:41:21,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:21,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 21:41:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-01-10 21:41:21,322 INFO L87 Difference]: Start difference. First operand 574 states and 738 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 21:41:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:21,598 INFO L93 Difference]: Finished difference Result 676 states and 856 transitions. [2022-01-10 21:41:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 21:41:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 43 [2022-01-10 21:41:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:21,599 INFO L225 Difference]: With dead ends: 676 [2022-01-10 21:41:21,599 INFO L226 Difference]: Without dead ends: 561 [2022-01-10 21:41:21,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-01-10 21:41:21,600 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 222 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 4926 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:21,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 4926 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-01-10 21:41:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 513. [2022-01-10 21:41:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 507 states have (on average 1.2741617357001973) internal successors, (646), 512 states have internal predecessors, (646), 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 21:41:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 646 transitions. [2022-01-10 21:41:21,647 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 646 transitions. Word has length 43 [2022-01-10 21:41:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:21,647 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 646 transitions. [2022-01-10 21:41:21,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 21:41:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 646 transitions. [2022-01-10 21:41:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 21:41:21,648 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:21,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:21,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-10 21:41:21,649 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1122536194, now seen corresponding path program 1 times [2022-01-10 21:41:21,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:21,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911994085] [2022-01-10 21:41:21,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:21,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:21,698 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 21:41:21,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:21,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911994085] [2022-01-10 21:41:21,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911994085] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:21,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:21,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:21,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070361887] [2022-01-10 21:41:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:21,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:21,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:21,700 INFO L87 Difference]: Start difference. First operand 513 states and 646 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 21:41:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:21,853 INFO L93 Difference]: Finished difference Result 653 states and 826 transitions. [2022-01-10 21:41:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2022-01-10 21:41:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:21,855 INFO L225 Difference]: With dead ends: 653 [2022-01-10 21:41:21,855 INFO L226 Difference]: Without dead ends: 513 [2022-01-10 21:41:21,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:21,856 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 483 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:21,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 787 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-01-10 21:41:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2022-01-10 21:41:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 507 states have (on average 1.2682445759368837) internal successors, (643), 512 states have internal predecessors, (643), 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 21:41:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 643 transitions. [2022-01-10 21:41:21,914 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 643 transitions. Word has length 43 [2022-01-10 21:41:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:21,915 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 643 transitions. [2022-01-10 21:41:21,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 21:41:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 643 transitions. [2022-01-10 21:41:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:21,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:21,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:21,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-10 21:41:21,916 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:21,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1242801906, now seen corresponding path program 1 times [2022-01-10 21:41:21,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:21,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74929093] [2022-01-10 21:41:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:21,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:21,983 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 21:41:21,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:21,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74929093] [2022-01-10 21:41:21,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74929093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:21,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:21,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 21:41:21,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359245298] [2022-01-10 21:41:21,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:21,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:41:21,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:21,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:41:21,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:21,985 INFO L87 Difference]: Start difference. First operand 513 states and 643 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 21:41:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:22,136 INFO L93 Difference]: Finished difference Result 529 states and 659 transitions. [2022-01-10 21:41:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 44 [2022-01-10 21:41:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:22,137 INFO L225 Difference]: With dead ends: 529 [2022-01-10 21:41:22,137 INFO L226 Difference]: Without dead ends: 470 [2022-01-10 21:41:22,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 21:41:22,138 INFO L933 BasicCegarLoop]: 458 mSDtfsCounter, 98 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 3662 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:22,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 3662 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-01-10 21:41:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-01-10 21:41:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 464 states have (on average 1.271551724137931) internal successors, (590), 469 states have internal predecessors, (590), 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 21:41:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 590 transitions. [2022-01-10 21:41:22,215 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 590 transitions. Word has length 44 [2022-01-10 21:41:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:22,215 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 590 transitions. [2022-01-10 21:41:22,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 21:41:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 590 transitions. [2022-01-10 21:41:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:22,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:22,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:22,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-10 21:41:22,216 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:22,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2027226062, now seen corresponding path program 1 times [2022-01-10 21:41:22,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:22,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789195169] [2022-01-10 21:41:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:22,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:22,254 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 21:41:22,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:22,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789195169] [2022-01-10 21:41:22,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789195169] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:22,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:22,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:22,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891097395] [2022-01-10 21:41:22,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:22,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:22,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:22,256 INFO L87 Difference]: Start difference. First operand 470 states and 590 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 21:41:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:22,323 INFO L93 Difference]: Finished difference Result 504 states and 624 transitions. [2022-01-10 21:41:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:22,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2022-01-10 21:41:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:22,324 INFO L225 Difference]: With dead ends: 504 [2022-01-10 21:41:22,324 INFO L226 Difference]: Without dead ends: 484 [2022-01-10 21:41:22,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:22,325 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 43 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:22,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1222 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-01-10 21:41:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 470. [2022-01-10 21:41:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 464 states have (on average 1.269396551724138) internal successors, (589), 469 states have internal predecessors, (589), 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 21:41:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 589 transitions. [2022-01-10 21:41:22,380 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 589 transitions. Word has length 44 [2022-01-10 21:41:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:22,380 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 589 transitions. [2022-01-10 21:41:22,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 21:41:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 589 transitions. [2022-01-10 21:41:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:22,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:22,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:22,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-10 21:41:22,381 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1182754191, now seen corresponding path program 1 times [2022-01-10 21:41:22,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:22,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456689105] [2022-01-10 21:41:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:22,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:22,434 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 21:41:22,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456689105] [2022-01-10 21:41:22,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456689105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:22,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:22,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:22,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601989632] [2022-01-10 21:41:22,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:22,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:22,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:22,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:22,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:22,437 INFO L87 Difference]: Start difference. First operand 470 states and 589 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 21:41:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:22,550 INFO L93 Difference]: Finished difference Result 484 states and 603 transitions. [2022-01-10 21:41:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:22,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 44 [2022-01-10 21:41:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:22,551 INFO L225 Difference]: With dead ends: 484 [2022-01-10 21:41:22,551 INFO L226 Difference]: Without dead ends: 444 [2022-01-10 21:41:22,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 21:41:22,552 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 60 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:22,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 2428 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-01-10 21:41:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2022-01-10 21:41:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 438 states have (on average 1.273972602739726) internal successors, (558), 443 states have internal predecessors, (558), 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 21:41:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 558 transitions. [2022-01-10 21:41:22,602 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 558 transitions. Word has length 44 [2022-01-10 21:41:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:22,603 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 558 transitions. [2022-01-10 21:41:22,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 21:41:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 558 transitions. [2022-01-10 21:41:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:22,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:22,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:22,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-10 21:41:22,604 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:22,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash -641691475, now seen corresponding path program 1 times [2022-01-10 21:41:22,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:22,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149843629] [2022-01-10 21:41:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:22,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:22,631 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 21:41:22,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:22,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149843629] [2022-01-10 21:41:22,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149843629] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:22,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:22,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:22,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844409089] [2022-01-10 21:41:22,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:22,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:22,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:22,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:22,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:22,633 INFO L87 Difference]: Start difference. First operand 444 states and 558 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 21:41:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:22,697 INFO L93 Difference]: Finished difference Result 483 states and 600 transitions. [2022-01-10 21:41:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:22,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2022-01-10 21:41:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:22,699 INFO L225 Difference]: With dead ends: 483 [2022-01-10 21:41:22,699 INFO L226 Difference]: Without dead ends: 446 [2022-01-10 21:41:22,699 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 21:41:22,701 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 242 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:22,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 520 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-01-10 21:41:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2022-01-10 21:41:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 435 states have (on average 1.271264367816092) internal successors, (553), 440 states have internal predecessors, (553), 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 21:41:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 553 transitions. [2022-01-10 21:41:22,755 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 553 transitions. Word has length 44 [2022-01-10 21:41:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:22,755 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 553 transitions. [2022-01-10 21:41:22,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 21:41:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 553 transitions. [2022-01-10 21:41:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 21:41:22,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:22,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:22,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-10 21:41:22,758 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash 89702358, now seen corresponding path program 1 times [2022-01-10 21:41:22,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:22,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063268404] [2022-01-10 21:41:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:22,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:22,790 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 21:41:22,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:22,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063268404] [2022-01-10 21:41:22,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063268404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:22,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:22,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:22,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94919511] [2022-01-10 21:41:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:22,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:22,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:22,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:22,792 INFO L87 Difference]: Start difference. First operand 441 states and 553 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 21:41:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:22,859 INFO L93 Difference]: Finished difference Result 467 states and 581 transitions. [2022-01-10 21:41:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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) Word has length 45 [2022-01-10 21:41:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:22,861 INFO L225 Difference]: With dead ends: 467 [2022-01-10 21:41:22,861 INFO L226 Difference]: Without dead ends: 435 [2022-01-10 21:41:22,861 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 21:41:22,863 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 37 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:22,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 761 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-10 21:41:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2022-01-10 21:41:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 426 states have (on average 1.2605633802816902) internal successors, (537), 431 states have internal predecessors, (537), 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 21:41:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 537 transitions. [2022-01-10 21:41:22,916 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 537 transitions. Word has length 45 [2022-01-10 21:41:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:22,916 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 537 transitions. [2022-01-10 21:41:22,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 21:41:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 537 transitions. [2022-01-10 21:41:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 21:41:22,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:22,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:22,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-10 21:41:22,917 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash -795347753, now seen corresponding path program 1 times [2022-01-10 21:41:22,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:22,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234247236] [2022-01-10 21:41:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:22,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:22,972 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 21:41:22,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:22,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234247236] [2022-01-10 21:41:22,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234247236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:22,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:22,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:22,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458336149] [2022-01-10 21:41:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:22,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:22,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:22,974 INFO L87 Difference]: Start difference. First operand 432 states and 537 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 21:41:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:23,086 INFO L93 Difference]: Finished difference Result 519 states and 639 transitions. [2022-01-10 21:41:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:23,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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) Word has length 45 [2022-01-10 21:41:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:23,087 INFO L225 Difference]: With dead ends: 519 [2022-01-10 21:41:23,088 INFO L226 Difference]: Without dead ends: 375 [2022-01-10 21:41:23,088 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 21:41:23,088 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 29 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:23,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 693 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-01-10 21:41:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 354. [2022-01-10 21:41:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 350 states have (on average 1.2285714285714286) internal successors, (430), 353 states have internal predecessors, (430), 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 21:41:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 430 transitions. [2022-01-10 21:41:23,125 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 430 transitions. Word has length 45 [2022-01-10 21:41:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:23,125 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 430 transitions. [2022-01-10 21:41:23,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 21:41:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 430 transitions. [2022-01-10 21:41:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 21:41:23,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:23,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:23,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-10 21:41:23,126 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash -244937221, now seen corresponding path program 1 times [2022-01-10 21:41:23,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:23,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427846456] [2022-01-10 21:41:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:23,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:23,231 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 21:41:23,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:23,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427846456] [2022-01-10 21:41:23,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427846456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:23,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:23,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 21:41:23,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82141147] [2022-01-10 21:41:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:23,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:41:23,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:41:23,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:23,233 INFO L87 Difference]: Start difference. First operand 354 states and 430 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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 21:41:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:23,517 INFO L93 Difference]: Finished difference Result 368 states and 444 transitions. [2022-01-10 21:41:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:23,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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 46 [2022-01-10 21:41:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:23,518 INFO L225 Difference]: With dead ends: 368 [2022-01-10 21:41:23,519 INFO L226 Difference]: Without dead ends: 309 [2022-01-10 21:41:23,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 21:41:23,519 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 329 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:23,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 2545 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-01-10 21:41:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2022-01-10 21:41:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.219672131147541) internal successors, (372), 308 states have internal predecessors, (372), 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 21:41:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 372 transitions. [2022-01-10 21:41:23,556 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 372 transitions. Word has length 46 [2022-01-10 21:41:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:23,556 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 372 transitions. [2022-01-10 21:41:23,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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 21:41:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 372 transitions. [2022-01-10 21:41:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 21:41:23,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:23,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:23,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-10 21:41:23,557 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2020146894, now seen corresponding path program 1 times [2022-01-10 21:41:23,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:23,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059330321] [2022-01-10 21:41:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:23,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:23,637 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 21:41:23,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:23,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059330321] [2022-01-10 21:41:23,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059330321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:23,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:23,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:23,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328411216] [2022-01-10 21:41:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:23,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:23,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:23,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:23,639 INFO L87 Difference]: Start difference. First operand 309 states and 372 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 21:41:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:23,890 INFO L93 Difference]: Finished difference Result 534 states and 637 transitions. [2022-01-10 21:41:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 21:41:23,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 47 [2022-01-10 21:41:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:23,891 INFO L225 Difference]: With dead ends: 534 [2022-01-10 21:41:23,891 INFO L226 Difference]: Without dead ends: 425 [2022-01-10 21:41:23,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-01-10 21:41:23,892 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 347 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:23,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 2101 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-01-10 21:41:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 317. [2022-01-10 21:41:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 313 states have (on average 1.207667731629393) internal successors, (378), 316 states have internal predecessors, (378), 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 21:41:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 378 transitions. [2022-01-10 21:41:23,932 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 378 transitions. Word has length 47 [2022-01-10 21:41:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:23,932 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 378 transitions. [2022-01-10 21:41:23,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 21:41:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 378 transitions. [2022-01-10 21:41:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 21:41:23,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:23,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:23,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-10 21:41:23,933 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash -389916940, now seen corresponding path program 1 times [2022-01-10 21:41:23,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:23,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442340196] [2022-01-10 21:41:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:23,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:24,020 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 21:41:24,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:24,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442340196] [2022-01-10 21:41:24,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442340196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:24,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:24,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:41:24,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841543048] [2022-01-10 21:41:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:24,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:41:24,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:24,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:41:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:41:24,022 INFO L87 Difference]: Start difference. First operand 317 states and 378 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 21:41:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:24,223 INFO L93 Difference]: Finished difference Result 665 states and 786 transitions. [2022-01-10 21:41:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:41:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 47 [2022-01-10 21:41:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:24,225 INFO L225 Difference]: With dead ends: 665 [2022-01-10 21:41:24,225 INFO L226 Difference]: Without dead ends: 588 [2022-01-10 21:41:24,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:24,225 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 365 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:24,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 1596 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-01-10 21:41:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 336. [2022-01-10 21:41:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 332 states have (on average 1.2018072289156627) internal successors, (399), 335 states have internal predecessors, (399), 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 21:41:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 399 transitions. [2022-01-10 21:41:24,279 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 399 transitions. Word has length 47 [2022-01-10 21:41:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:24,279 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 399 transitions. [2022-01-10 21:41:24,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 21:41:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 399 transitions. [2022-01-10 21:41:24,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 21:41:24,280 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:24,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:24,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-10 21:41:24,280 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:24,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -838613579, now seen corresponding path program 1 times [2022-01-10 21:41:24,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:24,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089731544] [2022-01-10 21:41:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:24,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:24,316 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 21:41:24,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:24,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089731544] [2022-01-10 21:41:24,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089731544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:24,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:24,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:24,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793851396] [2022-01-10 21:41:24,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:24,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:24,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:24,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:24,318 INFO L87 Difference]: Start difference. First operand 336 states and 399 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 21:41:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:24,424 INFO L93 Difference]: Finished difference Result 656 states and 772 transitions. [2022-01-10 21:41:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:24,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2022-01-10 21:41:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:24,426 INFO L225 Difference]: With dead ends: 656 [2022-01-10 21:41:24,426 INFO L226 Difference]: Without dead ends: 588 [2022-01-10 21:41:24,426 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 21:41:24,427 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 292 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:24,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 891 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-01-10 21:41:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 336. [2022-01-10 21:41:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 332 states have (on average 1.1957831325301205) internal successors, (397), 335 states have internal predecessors, (397), 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 21:41:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 397 transitions. [2022-01-10 21:41:24,478 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 397 transitions. Word has length 47 [2022-01-10 21:41:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:24,479 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 397 transitions. [2022-01-10 21:41:24,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 21:41:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 397 transitions. [2022-01-10 21:41:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 21:41:24,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:24,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:24,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-10 21:41:24,480 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:24,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1356135477, now seen corresponding path program 1 times [2022-01-10 21:41:24,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:24,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372679519] [2022-01-10 21:41:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:24,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:24,584 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 21:41:24,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:24,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372679519] [2022-01-10 21:41:24,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372679519] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:24,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:24,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 21:41:24,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640132573] [2022-01-10 21:41:24,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:24,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 21:41:24,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:24,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 21:41:24,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:24,585 INFO L87 Difference]: Start difference. First operand 336 states and 397 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 21:41:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:24,822 INFO L93 Difference]: Finished difference Result 336 states and 397 transitions. [2022-01-10 21:41:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:24,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 49 [2022-01-10 21:41:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:24,823 INFO L225 Difference]: With dead ends: 336 [2022-01-10 21:41:24,823 INFO L226 Difference]: Without dead ends: 259 [2022-01-10 21:41:24,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 21:41:24,824 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 296 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:24,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 2080 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-10 21:41:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-01-10 21:41:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 256 states have (on average 1.18359375) internal successors, (303), 258 states have internal predecessors, (303), 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 21:41:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 303 transitions. [2022-01-10 21:41:24,865 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 303 transitions. Word has length 49 [2022-01-10 21:41:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:24,865 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 303 transitions. [2022-01-10 21:41:24,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 21:41:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 303 transitions. [2022-01-10 21:41:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 21:41:24,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:24,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:24,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-10 21:41:24,866 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2022-01-10 21:41:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:24,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1877071681, now seen corresponding path program 1 times [2022-01-10 21:41:24,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:24,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703508250] [2022-01-10 21:41:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:24,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 21:41:24,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 21:41:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 21:41:24,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 21:41:24,935 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 21:41:24,936 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION (102 of 103 remaining) [2022-01-10 21:41:24,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION (101 of 103 remaining) [2022-01-10 21:41:24,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION (100 of 103 remaining) [2022-01-10 21:41:24,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION (99 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION (98 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION (97 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION (96 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION (95 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION (94 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (93 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (92 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION (91 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION (90 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION (89 of 103 remaining) [2022-01-10 21:41:24,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION (88 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION (87 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (86 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (85 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (84 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION (83 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION (82 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION (81 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION (80 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (79 of 103 remaining) [2022-01-10 21:41:24,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (78 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (77 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (76 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION (75 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION (74 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION (73 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION (72 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION (71 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION (70 of 103 remaining) [2022-01-10 21:41:24,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (69 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (68 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (67 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (66 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (65 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (64 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (63 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION (62 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION (61 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION (60 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION (59 of 103 remaining) [2022-01-10 21:41:24,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION (58 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION (57 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (56 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION (55 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION (54 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION (53 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (52 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (51 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (50 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (49 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION (48 of 103 remaining) [2022-01-10 21:41:24,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION (47 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION (46 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (45 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (44 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (43 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (42 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (41 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (40 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (39 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (38 of 103 remaining) [2022-01-10 21:41:24,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (37 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION (36 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION (35 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION (34 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (33 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (32 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (31 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (30 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (29 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (28 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION (27 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (26 of 103 remaining) [2022-01-10 21:41:24,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (25 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (24 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (23 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (22 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (21 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (20 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (19 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (18 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (17 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION (16 of 103 remaining) [2022-01-10 21:41:24,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (15 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (14 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION (13 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (12 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (11 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (10 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION (9 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (8 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (7 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (6 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (5 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION (4 of 103 remaining) [2022-01-10 21:41:24,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (3 of 103 remaining) [2022-01-10 21:41:24,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (2 of 103 remaining) [2022-01-10 21:41:24,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION (1 of 103 remaining) [2022-01-10 21:41:24,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION (0 of 103 remaining) [2022-01-10 21:41:24,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-10 21:41:24,950 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:24,953 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:41:25,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:41:25 BasicIcfg [2022-01-10 21:41:25,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:41:25,398 INFO L158 Benchmark]: Toolchain (without parser) took 26447.03ms. Allocated memory was 191.9MB in the beginning and 803.2MB in the end (delta: 611.3MB). Free memory was 133.5MB in the beginning and 732.2MB in the end (delta: -598.7MB). Peak memory consumption was 481.9MB. Max. memory is 8.0GB. [2022-01-10 21:41:25,398 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 191.9MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:41:25,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.37ms. Allocated memory was 191.9MB in the beginning and 294.6MB in the end (delta: 102.8MB). Free memory was 133.3MB in the beginning and 247.3MB in the end (delta: -114.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-01-10 21:41:25,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 155.32ms. Allocated memory is still 294.6MB. Free memory was 247.3MB in the beginning and 231.1MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-10 21:41:25,398 INFO L158 Benchmark]: Boogie Preprocessor took 119.92ms. Allocated memory is still 294.6MB. Free memory was 231.1MB in the beginning and 219.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 21:41:25,398 INFO L158 Benchmark]: RCFGBuilder took 2484.47ms. Allocated memory is still 294.6MB. Free memory was 219.0MB in the beginning and 222.1MB in the end (delta: -3.1MB). Peak memory consumption was 142.7MB. Max. memory is 8.0GB. [2022-01-10 21:41:25,398 INFO L158 Benchmark]: IcfgTransformer took 458.29ms. Allocated memory is still 294.6MB. Free memory was 222.1MB in the beginning and 118.3MB in the end (delta: 103.8MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2022-01-10 21:41:25,399 INFO L158 Benchmark]: TraceAbstraction took 22679.56ms. Allocated memory was 294.6MB in the beginning and 803.2MB in the end (delta: 508.6MB). Free memory was 117.8MB in the beginning and 732.2MB in the end (delta: -614.4MB). Peak memory consumption was 363.4MB. Max. memory is 8.0GB. [2022-01-10 21:41:25,399 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 191.9MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 543.37ms. Allocated memory was 191.9MB in the beginning and 294.6MB in the end (delta: 102.8MB). Free memory was 133.3MB in the beginning and 247.3MB in the end (delta: -114.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 155.32ms. Allocated memory is still 294.6MB. Free memory was 247.3MB in the beginning and 231.1MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 119.92ms. Allocated memory is still 294.6MB. Free memory was 231.1MB in the beginning and 219.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * RCFGBuilder took 2484.47ms. Allocated memory is still 294.6MB. Free memory was 219.0MB in the beginning and 222.1MB in the end (delta: -3.1MB). Peak memory consumption was 142.7MB. Max. memory is 8.0GB. * IcfgTransformer took 458.29ms. Allocated memory is still 294.6MB. Free memory was 222.1MB in the beginning and 118.3MB in the end (delta: 103.8MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. * TraceAbstraction took 22679.56ms. Allocated memory was 294.6MB in the beginning and 803.2MB in the end (delta: 508.6MB). Free memory was 117.8MB in the beginning and 732.2MB in the end (delta: -614.4MB). Peak memory consumption was 363.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L1755] CALL _BLAST_init() [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1755] RET _BLAST_init() [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1772] CALL stub_driver_init() [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1772] RET stub_driver_init() [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0] [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(Context)=0, \old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(Context)=0, \old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [\old(Context)=0, \old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [\old(Context)=0, \old(DeviceObject)=0, \old(Irp)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1944] returnVal2 = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1981] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, __cil_tmp8=18446744072635809979, compFptr=0, compRegistered=1, compRetStatus=3221225659, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1869] COND TRUE status != 259 [L1871] CALL errorFn() [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1315 locations, 103 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 59, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23132 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23132 mSDsluCounter, 177581 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124993 mSDsCounter, 975 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8137 IncrementalHoareTripleChecker+Invalid, 9112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 975 mSolverCounterUnsat, 52588 mSDtfsCounter, 8137 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1315occurred in iteration=0, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 58 MinimizatonAttempts, 3229 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2115 NumberOfCodeBlocks, 2115 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2008 ConstructedInterpolants, 0 QuantifiedInterpolants, 5338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 58 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 21:41:25,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...