/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/floppy_simpl4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:41:40,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:41:40,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:41:41,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:41:41,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:41:41,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:41:41,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:41:41,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:41:41,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:41:41,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:41:41,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:41:41,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:41:41,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:41:41,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:41:41,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:41:41,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:41:41,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:41:41,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:41:41,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:41:41,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:41:41,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:41:41,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:41:41,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:41:41,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:41:41,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:41:41,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:41:41,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:41:41,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:41:41,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:41:41,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:41:41,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:41:41,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:41:41,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:41:41,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:41:41,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:41:41,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:41:41,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:41:41,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:41:41,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:41:41,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:41:41,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:41:41,048 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:41:41,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:41:41,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:41:41,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:41:41,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:41:41,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:41:41,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:41:41,066 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:41:41,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:41:41,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:41:41,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:41:41,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:41:41,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:41:41,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:41:41,066 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:41:41,067 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:41:41,067 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:41:41,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:41:41,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:41:41,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:41:41,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:41:41,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:41:41,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:41:41,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:41:41,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:41:41,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:41:41,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:41:41,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:41:41,071 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:41:41,072 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:41:41,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:41:41,072 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:41:41,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:41:41,073 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:41:41,073 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:41:41,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:41:41,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:41:41,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:41:41,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:41:41,279 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:41:41,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-1.c [2022-01-10 21:41:41,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727d6212d/3a7d5586b2954c879e4f697240e46c96/FLAG2334335d7 [2022-01-10 21:41:41,773 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:41:41,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-1.c [2022-01-10 21:41:41,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727d6212d/3a7d5586b2954c879e4f697240e46c96/FLAG2334335d7 [2022-01-10 21:41:41,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727d6212d/3a7d5586b2954c879e4f697240e46c96 [2022-01-10 21:41:41,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:41:41,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:41:41,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:41:41,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:41:41,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:41:41,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:41:41" (1/1) ... [2022-01-10 21:41:41,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314256e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:41, skipping insertion in model container [2022-01-10 21:41:41,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:41:41" (1/1) ... [2022-01-10 21:41:41,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:41:41,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:41:42,199 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/floppy_simpl4.cil-1.c[48581,48594] [2022-01-10 21:41:42,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:41:42,213 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:41:42,285 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/floppy_simpl4.cil-1.c[48581,48594] [2022-01-10 21:41:42,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:41:42,300 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:41:42,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42 WrapperNode [2022-01-10 21:41:42,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:41:42,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:41:42,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:41:42,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:41:42,306 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:41:42" (1/1) ... [2022-01-10 21:41:42,330 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:41:42" (1/1) ... [2022-01-10 21:41:42,420 INFO L137 Inliner]: procedures = 41, calls = 77, calls flagged for inlining = 72, calls inlined = 138, statements flattened = 2441 [2022-01-10 21:41:42,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:41:42,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:41:42,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:41:42,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:41:42,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (1/1) ... [2022-01-10 21:41:42,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (1/1) ... [2022-01-10 21:41:42,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (1/1) ... [2022-01-10 21:41:42,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (1/1) ... [2022-01-10 21:41:42,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (1/1) ... [2022-01-10 21:41:42,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (1/1) ... [2022-01-10 21:41:42,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (1/1) ... [2022-01-10 21:41:42,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:41:42,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:41:42,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:41:42,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:41:42,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (1/1) ... [2022-01-10 21:41:42,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:41:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:41:42,558 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:41:42,568 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:41:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:41:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:41:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:41:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:41:42,769 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:41:42,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:41:42,777 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,785 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,788 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,792 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,794 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,794 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,798 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,803 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,806 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,809 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,810 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,812 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,814 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,817 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,819 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,819 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,823 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,825 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,826 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,827 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,829 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,831 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,834 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,846 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,847 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,849 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,850 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,851 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,852 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:42,853 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2022-01-10 21:41:43,568 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2022-01-10 21:41:43,569 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2022-01-10 21:41:43,570 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2022-01-10 21:41:43,571 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2022-01-10 21:41:43,572 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2022-01-10 21:41:43,573 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-01-10 21:41:43,573 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-01-10 21:41:43,573 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:41:43,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:41:43,582 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:41:43,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:43 BoogieIcfgContainer [2022-01-10 21:41:43,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:41:43,585 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:41:43,585 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:41:43,586 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:41:43,588 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:43" (1/1) ... [2022-01-10 21:41:43,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:41:43 BasicIcfg [2022-01-10 21:41:43,843 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:41:43,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:41:43,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:41:43,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:41:43,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:41:41" (1/4) ... [2022-01-10 21:41:43,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232fc691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:41:43, skipping insertion in model container [2022-01-10 21:41:43,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:42" (2/4) ... [2022-01-10 21:41:43,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232fc691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:41:43, skipping insertion in model container [2022-01-10 21:41:43,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:43" (3/4) ... [2022-01-10 21:41:43,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232fc691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:41:43, skipping insertion in model container [2022-01-10 21:41:43,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:41:43" (4/4) ... [2022-01-10 21:41:43,847 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.cTransformedIcfg [2022-01-10 21:41:43,850 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:41:43,851 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-01-10 21:41:43,893 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:41:43,897 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:43,897 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2022-01-10 21:41:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 642 states, 587 states have (on average 1.5315161839863713) internal successors, (899), 641 states have internal predecessors, (899), 0 states have call successors, (0), 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:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 21:41:43,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:43,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:43,929 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 683299230, now seen corresponding path program 1 times [2022-01-10 21:41:43,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:43,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184118997] [2022-01-10 21:41:43,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:43,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:44,186 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:44,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:44,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184118997] [2022-01-10 21:41:44,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184118997] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:44,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:44,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:44,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485912256] [2022-01-10 21:41:44,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:44,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:44,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:44,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:44,213 INFO L87 Difference]: Start difference. First operand has 642 states, 587 states have (on average 1.5315161839863713) internal successors, (899), 641 states have internal predecessors, (899), 0 states have call successors, (0), 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:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:44,498 INFO L93 Difference]: Finished difference Result 1220 states and 1710 transitions. [2022-01-10 21:41:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:44,500 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:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:44,510 INFO L225 Difference]: With dead ends: 1220 [2022-01-10 21:41:44,510 INFO L226 Difference]: Without dead ends: 708 [2022-01-10 21:41:44,513 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:44,515 INFO L933 BasicCegarLoop]: 865 mSDtfsCounter, 435 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:44,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 1217 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-01-10 21:41:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 682. [2022-01-10 21:41:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 647 states have (on average 1.4234930448222565) internal successors, (921), 681 states have internal predecessors, (921), 0 states have call successors, (0), 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:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 921 transitions. [2022-01-10 21:41:44,561 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 921 transitions. Word has length 12 [2022-01-10 21:41:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:44,561 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 921 transitions. [2022-01-10 21:41:44,561 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:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 921 transitions. [2022-01-10 21:41:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 21:41:44,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:44,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:44,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:41:44,562 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash -819188063, now seen corresponding path program 1 times [2022-01-10 21:41:44,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:44,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230808556] [2022-01-10 21:41:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:44,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:44,621 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:44,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230808556] [2022-01-10 21:41:44,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230808556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:44,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:44,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:44,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124390658] [2022-01-10 21:41:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:44,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:44,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:44,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:44,623 INFO L87 Difference]: Start difference. First operand 682 states and 921 transitions. 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:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:44,757 INFO L93 Difference]: Finished difference Result 704 states and 946 transitions. [2022-01-10 21:41:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:44,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:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:44,759 INFO L225 Difference]: With dead ends: 704 [2022-01-10 21:41:44,759 INFO L226 Difference]: Without dead ends: 682 [2022-01-10 21:41:44,759 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:44,760 INFO L933 BasicCegarLoop]: 736 mSDtfsCounter, 4 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:44,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1304 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-01-10 21:41:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2022-01-10 21:41:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 647 states have (on average 1.4219474497681608) internal successors, (920), 681 states have internal predecessors, (920), 0 states have call successors, (0), 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:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 920 transitions. [2022-01-10 21:41:44,776 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 920 transitions. Word has length 12 [2022-01-10 21:41:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:44,776 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 920 transitions. [2022-01-10 21:41:44,776 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:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 920 transitions. [2022-01-10 21:41:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 21:41:44,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:44,777 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:44,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:41:44,777 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash 71589863, now seen corresponding path program 1 times [2022-01-10 21:41:44,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:44,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442469794] [2022-01-10 21:41:44,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:44,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:44,812 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:44,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:44,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442469794] [2022-01-10 21:41:44,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442469794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:44,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:44,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:44,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547350594] [2022-01-10 21:41:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:44,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:44,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:44,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:44,814 INFO L87 Difference]: Start difference. First operand 682 states and 920 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:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:44,842 INFO L93 Difference]: Finished difference Result 781 states and 1041 transitions. [2022-01-10 21:41:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:44,842 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:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:44,844 INFO L225 Difference]: With dead ends: 781 [2022-01-10 21:41:44,844 INFO L226 Difference]: Without dead ends: 754 [2022-01-10 21:41:44,845 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:44,846 INFO L933 BasicCegarLoop]: 727 mSDtfsCounter, 704 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:44,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 818 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-01-10 21:41:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 705. [2022-01-10 21:41:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 673 states have (on average 1.4264487369985142) internal successors, (960), 704 states have internal predecessors, (960), 0 states have call successors, (0), 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:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 960 transitions. [2022-01-10 21:41:44,861 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 960 transitions. Word has length 18 [2022-01-10 21:41:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:44,862 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 960 transitions. [2022-01-10 21:41:44,862 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:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 960 transitions. [2022-01-10 21:41:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 21:41:44,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:44,863 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:44,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:41:44,863 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1246132909, now seen corresponding path program 1 times [2022-01-10 21:41:44,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:44,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626190387] [2022-01-10 21:41:44,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:44,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:44,902 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:44,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:44,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626190387] [2022-01-10 21:41:44,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626190387] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:44,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:44,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:44,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782231127] [2022-01-10 21:41:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:44,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:44,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:44,906 INFO L87 Difference]: Start difference. First operand 705 states and 960 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:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:45,046 INFO L93 Difference]: Finished difference Result 742 states and 1006 transitions. [2022-01-10 21:41:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:45,046 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:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:45,048 INFO L225 Difference]: With dead ends: 742 [2022-01-10 21:41:45,048 INFO L226 Difference]: Without dead ends: 737 [2022-01-10 21:41:45,049 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:45,049 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 36 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:45,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1276 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-01-10 21:41:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 734. [2022-01-10 21:41:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 702 states have (on average 1.4216524216524216) internal successors, (998), 733 states have internal predecessors, (998), 0 states have call successors, (0), 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:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 998 transitions. [2022-01-10 21:41:45,087 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 998 transitions. Word has length 21 [2022-01-10 21:41:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:45,087 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 998 transitions. [2022-01-10 21:41:45,087 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:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 998 transitions. [2022-01-10 21:41:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 21:41:45,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:45,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] [2022-01-10 21:41:45,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:41:45,092 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash 799314552, now seen corresponding path program 1 times [2022-01-10 21:41:45,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:45,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829702846] [2022-01-10 21:41:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:45,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:45,156 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:45,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:45,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829702846] [2022-01-10 21:41:45,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829702846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:45,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:45,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:45,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212178449] [2022-01-10 21:41:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:45,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:45,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:45,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:45,158 INFO L87 Difference]: Start difference. First operand 734 states and 998 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:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:45,209 INFO L93 Difference]: Finished difference Result 1251 states and 1692 transitions. [2022-01-10 21:41:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:45,210 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:45,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:45,212 INFO L225 Difference]: With dead ends: 1251 [2022-01-10 21:41:45,212 INFO L226 Difference]: Without dead ends: 869 [2022-01-10 21:41:45,213 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:45,215 INFO L933 BasicCegarLoop]: 644 mSDtfsCounter, 593 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:45,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 853 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-01-10 21:41:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 707. [2022-01-10 21:41:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 685 states have (on average 1.4087591240875912) internal successors, (965), 706 states have internal predecessors, (965), 0 states have call successors, (0), 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:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 965 transitions. [2022-01-10 21:41:45,236 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 965 transitions. Word has length 21 [2022-01-10 21:41:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:45,236 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 965 transitions. [2022-01-10 21:41:45,237 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:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 965 transitions. [2022-01-10 21:41:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 21:41:45,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:45,238 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:45,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:41:45,238 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash -23566358, now seen corresponding path program 1 times [2022-01-10 21:41:45,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:45,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283512632] [2022-01-10 21:41:45,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:45,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:45,287 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:45,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:45,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283512632] [2022-01-10 21:41:45,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283512632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:45,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:45,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:45,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262501584] [2022-01-10 21:41:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:45,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:45,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:45,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:45,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:45,289 INFO L87 Difference]: Start difference. First operand 707 states and 965 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:45,326 INFO L93 Difference]: Finished difference Result 719 states and 978 transitions. [2022-01-10 21:41:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:45,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:45,328 INFO L225 Difference]: With dead ends: 719 [2022-01-10 21:41:45,328 INFO L226 Difference]: Without dead ends: 699 [2022-01-10 21:41:45,329 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:45,330 INFO L933 BasicCegarLoop]: 650 mSDtfsCounter, 639 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:45,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 1319 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-01-10 21:41:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2022-01-10 21:41:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 677 states have (on average 1.410635155096012) internal successors, (955), 698 states have internal predecessors, (955), 0 states have call successors, (0), 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:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 955 transitions. [2022-01-10 21:41:45,357 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 955 transitions. Word has length 22 [2022-01-10 21:41:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:45,357 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 955 transitions. [2022-01-10 21:41:45,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 955 transitions. [2022-01-10 21:41:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 21:41:45,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:45,358 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] [2022-01-10 21:41:45,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:41:45,358 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash 172334224, now seen corresponding path program 1 times [2022-01-10 21:41:45,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:45,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233697019] [2022-01-10 21:41:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:45,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:45,408 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:45,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:45,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233697019] [2022-01-10 21:41:45,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233697019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:45,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:45,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:45,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026692879] [2022-01-10 21:41:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:45,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:45,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:45,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:45,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:45,410 INFO L87 Difference]: Start difference. First operand 699 states and 955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:45,571 INFO L93 Difference]: Finished difference Result 699 states and 955 transitions. [2022-01-10 21:41:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:45,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 21:41:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:45,574 INFO L225 Difference]: With dead ends: 699 [2022-01-10 21:41:45,574 INFO L226 Difference]: Without dead ends: 683 [2022-01-10 21:41:45,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:45,575 INFO L933 BasicCegarLoop]: 589 mSDtfsCounter, 97 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:45,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 996 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-01-10 21:41:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2022-01-10 21:41:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 669 states have (on average 1.4020926756352765) internal successors, (938), 682 states have internal predecessors, (938), 0 states have call successors, (0), 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:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 938 transitions. [2022-01-10 21:41:45,598 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 938 transitions. Word has length 25 [2022-01-10 21:41:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:45,598 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 938 transitions. [2022-01-10 21:41:45,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 938 transitions. [2022-01-10 21:41:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 21:41:45,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:45,599 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] [2022-01-10 21:41:45,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:41:45,599 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash -173862894, now seen corresponding path program 1 times [2022-01-10 21:41:45,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:45,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259924065] [2022-01-10 21:41:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:45,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:45,632 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:45,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:45,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259924065] [2022-01-10 21:41:45,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259924065] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:45,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:45,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:45,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630519554] [2022-01-10 21:41:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:45,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:45,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:45,633 INFO L87 Difference]: Start difference. First operand 683 states and 938 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:45,673 INFO L93 Difference]: Finished difference Result 696 states and 952 transitions. [2022-01-10 21:41:45,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:45,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-01-10 21:41:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:45,675 INFO L225 Difference]: With dead ends: 696 [2022-01-10 21:41:45,675 INFO L226 Difference]: Without dead ends: 681 [2022-01-10 21:41:45,675 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:45,676 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 16 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:45,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1869 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-01-10 21:41:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2022-01-10 21:41:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 667 states have (on average 1.4017991004497752) internal successors, (935), 680 states have internal predecessors, (935), 0 states have call successors, (0), 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:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 935 transitions. [2022-01-10 21:41:45,698 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 935 transitions. Word has length 26 [2022-01-10 21:41:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:45,698 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 935 transitions. [2022-01-10 21:41:45,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 935 transitions. [2022-01-10 21:41:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 21:41:45,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:45,699 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:45,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:41:45,699 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash 322397897, now seen corresponding path program 1 times [2022-01-10 21:41:45,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:45,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114451451] [2022-01-10 21:41:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:45,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:45,732 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:45,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:45,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114451451] [2022-01-10 21:41:45,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114451451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:45,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:45,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:45,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683168881] [2022-01-10 21:41:45,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:45,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:45,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:45,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:45,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:45,734 INFO L87 Difference]: Start difference. First operand 681 states and 935 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:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:45,899 INFO L93 Difference]: Finished difference Result 883 states and 1205 transitions. [2022-01-10 21:41:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:45,899 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:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:45,901 INFO L225 Difference]: With dead ends: 883 [2022-01-10 21:41:45,902 INFO L226 Difference]: Without dead ends: 875 [2022-01-10 21:41:45,902 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:45,902 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 131 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:45,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 1214 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-01-10 21:41:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 699. [2022-01-10 21:41:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 685 states have (on average 1.4043795620437955) internal successors, (962), 698 states have internal predecessors, (962), 0 states have call successors, (0), 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:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 962 transitions. [2022-01-10 21:41:45,924 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 962 transitions. Word has length 27 [2022-01-10 21:41:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:45,924 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 962 transitions. [2022-01-10 21:41:45,924 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:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 962 transitions. [2022-01-10 21:41:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 21:41:45,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:45,925 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] [2022-01-10 21:41:45,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:41:45,925 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash -540340936, now seen corresponding path program 1 times [2022-01-10 21:41:45,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:45,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252349597] [2022-01-10 21:41:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:45,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:45,961 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:45,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:45,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252349597] [2022-01-10 21:41:45,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252349597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:45,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:45,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:45,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685257589] [2022-01-10 21:41:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:45,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:45,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:45,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:45,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:45,962 INFO L87 Difference]: Start difference. First operand 699 states and 962 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:46,000 INFO L93 Difference]: Finished difference Result 712 states and 976 transitions. [2022-01-10 21:41:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-10 21:41:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:46,003 INFO L225 Difference]: With dead ends: 712 [2022-01-10 21:41:46,003 INFO L226 Difference]: Without dead ends: 697 [2022-01-10 21:41:46,003 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:46,003 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 16 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:46,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1862 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:46,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-01-10 21:41:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2022-01-10 21:41:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 683 states have (on average 1.404099560761347) internal successors, (959), 696 states have internal predecessors, (959), 0 states have call successors, (0), 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:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 959 transitions. [2022-01-10 21:41:46,038 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 959 transitions. Word has length 28 [2022-01-10 21:41:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:46,038 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 959 transitions. [2022-01-10 21:41:46,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 959 transitions. [2022-01-10 21:41:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 21:41:46,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:46,039 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] [2022-01-10 21:41:46,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:41:46,040 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:46,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1403376077, now seen corresponding path program 1 times [2022-01-10 21:41:46,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:46,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519552706] [2022-01-10 21:41:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:46,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:46,087 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:46,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:46,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519552706] [2022-01-10 21:41:46,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519552706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:46,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:46,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:46,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035986249] [2022-01-10 21:41:46,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:46,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:46,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:46,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:46,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:46,089 INFO L87 Difference]: Start difference. First operand 697 states and 959 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:46,147 INFO L93 Difference]: Finished difference Result 805 states and 1087 transitions. [2022-01-10 21:41:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-10 21:41:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:46,150 INFO L225 Difference]: With dead ends: 805 [2022-01-10 21:41:46,150 INFO L226 Difference]: Without dead ends: 752 [2022-01-10 21:41:46,151 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:46,151 INFO L933 BasicCegarLoop]: 658 mSDtfsCounter, 56 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:46,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 1912 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-01-10 21:41:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 699. [2022-01-10 21:41:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 685 states have (on average 1.402919708029197) internal successors, (961), 698 states have internal predecessors, (961), 0 states have call successors, (0), 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:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 961 transitions. [2022-01-10 21:41:46,172 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 961 transitions. Word has length 28 [2022-01-10 21:41:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:46,172 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 961 transitions. [2022-01-10 21:41:46,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 961 transitions. [2022-01-10 21:41:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 21:41:46,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:46,174 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] [2022-01-10 21:41:46,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:41:46,174 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:46,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1129694050, now seen corresponding path program 1 times [2022-01-10 21:41:46,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:46,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604890087] [2022-01-10 21:41:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:46,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:46,213 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:46,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:46,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604890087] [2022-01-10 21:41:46,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604890087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:46,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:46,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:46,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929999458] [2022-01-10 21:41:46,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:46,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:46,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:46,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:46,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:46,215 INFO L87 Difference]: Start difference. First operand 699 states and 961 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:46,245 INFO L93 Difference]: Finished difference Result 732 states and 998 transitions. [2022-01-10 21:41:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-10 21:41:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:46,248 INFO L225 Difference]: With dead ends: 732 [2022-01-10 21:41:46,248 INFO L226 Difference]: Without dead ends: 690 [2022-01-10 21:41:46,248 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:46,249 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 73 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:46,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 1248 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-01-10 21:41:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 685. [2022-01-10 21:41:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 671 states have (on average 1.3964232488822652) internal successors, (937), 684 states have internal predecessors, (937), 0 states have call successors, (0), 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:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 937 transitions. [2022-01-10 21:41:46,268 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 937 transitions. Word has length 29 [2022-01-10 21:41:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:46,269 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 937 transitions. [2022-01-10 21:41:46,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 937 transitions. [2022-01-10 21:41:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 21:41:46,269 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:46,269 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] [2022-01-10 21:41:46,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:41:46,270 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:46,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash 343192443, now seen corresponding path program 1 times [2022-01-10 21:41:46,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:46,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413848900] [2022-01-10 21:41:46,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:46,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:46,301 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:46,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:46,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413848900] [2022-01-10 21:41:46,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413848900] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:46,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:46,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:46,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779865029] [2022-01-10 21:41:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:46,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:46,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:46,303 INFO L87 Difference]: Start difference. First operand 685 states and 937 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:46,349 INFO L93 Difference]: Finished difference Result 724 states and 979 transitions. [2022-01-10 21:41:46,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:46,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-10 21:41:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:46,351 INFO L225 Difference]: With dead ends: 724 [2022-01-10 21:41:46,351 INFO L226 Difference]: Without dead ends: 703 [2022-01-10 21:41:46,352 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:46,353 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 37 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:46,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1845 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-01-10 21:41:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 687. [2022-01-10 21:41:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 673 states have (on average 1.3952451708766715) internal successors, (939), 686 states have internal predecessors, (939), 0 states have call successors, (0), 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:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 939 transitions. [2022-01-10 21:41:46,372 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 939 transitions. Word has length 29 [2022-01-10 21:41:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:46,373 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 939 transitions. [2022-01-10 21:41:46,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 939 transitions. [2022-01-10 21:41:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 21:41:46,373 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:46,373 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:46,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:41:46,373 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1925244698, now seen corresponding path program 1 times [2022-01-10 21:41:46,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:46,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405032441] [2022-01-10 21:41:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:46,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:46,418 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:46,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:46,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405032441] [2022-01-10 21:41:46,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405032441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:46,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:46,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:46,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763946713] [2022-01-10 21:41:46,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:46,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:46,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:46,419 INFO L87 Difference]: Start difference. First operand 687 states and 939 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:46,480 INFO L93 Difference]: Finished difference Result 726 states and 981 transitions. [2022-01-10 21:41:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:46,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:46,482 INFO L225 Difference]: With dead ends: 726 [2022-01-10 21:41:46,482 INFO L226 Difference]: Without dead ends: 705 [2022-01-10 21:41:46,483 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:46,483 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 37 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:46,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1845 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-01-10 21:41:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 687. [2022-01-10 21:41:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 673 states have (on average 1.3952451708766715) internal successors, (939), 686 states have internal predecessors, (939), 0 states have call successors, (0), 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:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 939 transitions. [2022-01-10 21:41:46,504 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 939 transitions. Word has length 30 [2022-01-10 21:41:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:46,504 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 939 transitions. [2022-01-10 21:41:46,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 939 transitions. [2022-01-10 21:41:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 21:41:46,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:46,505 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:46,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:41:46,505 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1631841691, now seen corresponding path program 1 times [2022-01-10 21:41:46,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:46,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103208357] [2022-01-10 21:41:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:46,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:46,593 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:46,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:46,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103208357] [2022-01-10 21:41:46,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103208357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:46,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:46,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:46,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624659118] [2022-01-10 21:41:46,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:46,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:46,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:46,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:46,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:46,594 INFO L87 Difference]: Start difference. First operand 687 states and 939 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:46,677 INFO L93 Difference]: Finished difference Result 726 states and 981 transitions. [2022-01-10 21:41:46,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:46,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:46,679 INFO L225 Difference]: With dead ends: 726 [2022-01-10 21:41:46,679 INFO L226 Difference]: Without dead ends: 705 [2022-01-10 21:41:46,679 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:46,680 INFO L933 BasicCegarLoop]: 631 mSDtfsCounter, 38 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:46,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1823 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-01-10 21:41:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 687. [2022-01-10 21:41:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 673 states have (on average 1.3952451708766715) internal successors, (939), 686 states have internal predecessors, (939), 0 states have call successors, (0), 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:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 939 transitions. [2022-01-10 21:41:46,700 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 939 transitions. Word has length 30 [2022-01-10 21:41:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:46,700 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 939 transitions. [2022-01-10 21:41:46,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 939 transitions. [2022-01-10 21:41:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 21:41:46,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:46,701 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:46,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:41:46,701 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1967609863, now seen corresponding path program 1 times [2022-01-10 21:41:46,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:46,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792877504] [2022-01-10 21:41:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:46,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:46,754 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:46,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:46,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792877504] [2022-01-10 21:41:46,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792877504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:46,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:46,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:46,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489311938] [2022-01-10 21:41:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:46,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:46,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:46,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:46,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:46,756 INFO L87 Difference]: Start difference. First operand 687 states and 939 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:47,008 INFO L93 Difference]: Finished difference Result 974 states and 1300 transitions. [2022-01-10 21:41:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:47,010 INFO L225 Difference]: With dead ends: 974 [2022-01-10 21:41:47,010 INFO L226 Difference]: Without dead ends: 721 [2022-01-10 21:41:47,011 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:47,011 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 995 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:47,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [995 Valid, 926 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-01-10 21:41:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 670. [2022-01-10 21:41:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 657 states have (on average 1.3744292237442923) internal successors, (903), 669 states have internal predecessors, (903), 0 states have call successors, (0), 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:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 903 transitions. [2022-01-10 21:41:47,036 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 903 transitions. Word has length 31 [2022-01-10 21:41:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:47,036 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 903 transitions. [2022-01-10 21:41:47,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 903 transitions. [2022-01-10 21:41:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:41:47,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:47,037 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:47,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 21:41:47,037 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1446481774, now seen corresponding path program 1 times [2022-01-10 21:41:47,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:47,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170802542] [2022-01-10 21:41:47,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:47,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:47,066 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:47,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:47,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170802542] [2022-01-10 21:41:47,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170802542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:47,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:47,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:47,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960505487] [2022-01-10 21:41:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:47,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:47,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:47,068 INFO L87 Difference]: Start difference. First operand 670 states and 903 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:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:47,222 INFO L93 Difference]: Finished difference Result 683 states and 913 transitions. [2022-01-10 21:41:47,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:47,223 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:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:47,224 INFO L225 Difference]: With dead ends: 683 [2022-01-10 21:41:47,224 INFO L226 Difference]: Without dead ends: 674 [2022-01-10 21:41:47,225 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:47,225 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 651 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:47,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [651 Valid, 1052 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-01-10 21:41:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 670. [2022-01-10 21:41:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 657 states have (on average 1.3713850837138508) internal successors, (901), 669 states have internal predecessors, (901), 0 states have call successors, (0), 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:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 901 transitions. [2022-01-10 21:41:47,253 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 901 transitions. Word has length 32 [2022-01-10 21:41:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:47,253 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 901 transitions. [2022-01-10 21:41:47,253 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:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 901 transitions. [2022-01-10 21:41:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:47,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:47,254 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:47,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 21:41:47,254 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:47,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1860476277, now seen corresponding path program 1 times [2022-01-10 21:41:47,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:47,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042444803] [2022-01-10 21:41:47,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:47,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:47,282 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:47,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042444803] [2022-01-10 21:41:47,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042444803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:47,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:47,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:47,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31537831] [2022-01-10 21:41:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:47,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:47,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:47,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:47,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:47,283 INFO L87 Difference]: Start difference. First operand 670 states and 901 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:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:47,428 INFO L93 Difference]: Finished difference Result 683 states and 911 transitions. [2022-01-10 21:41:47,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:47,428 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:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:47,430 INFO L225 Difference]: With dead ends: 683 [2022-01-10 21:41:47,430 INFO L226 Difference]: Without dead ends: 674 [2022-01-10 21:41:47,430 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:47,431 INFO L933 BasicCegarLoop]: 589 mSDtfsCounter, 648 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:47,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 1053 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-01-10 21:41:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 670. [2022-01-10 21:41:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 657 states have (on average 1.3683409436834095) internal successors, (899), 669 states have internal predecessors, (899), 0 states have call successors, (0), 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:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 899 transitions. [2022-01-10 21:41:47,462 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 899 transitions. Word has length 33 [2022-01-10 21:41:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:47,462 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 899 transitions. [2022-01-10 21:41:47,462 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:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 899 transitions. [2022-01-10 21:41:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:47,463 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:47,463 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:47,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 21:41:47,463 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1695435270, now seen corresponding path program 1 times [2022-01-10 21:41:47,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:47,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977105984] [2022-01-10 21:41:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:47,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:47,487 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:47,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:47,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977105984] [2022-01-10 21:41:47,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977105984] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:47,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:47,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:47,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578221834] [2022-01-10 21:41:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:47,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:47,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:47,488 INFO L87 Difference]: Start difference. First operand 670 states and 899 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:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:47,640 INFO L93 Difference]: Finished difference Result 857 states and 1133 transitions. [2022-01-10 21:41:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:47,640 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:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:47,642 INFO L225 Difference]: With dead ends: 857 [2022-01-10 21:41:47,642 INFO L226 Difference]: Without dead ends: 844 [2022-01-10 21:41:47,642 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:47,643 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 178 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:47,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 1101 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-01-10 21:41:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 722. [2022-01-10 21:41:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 709 states have (on average 1.3526093088857545) internal successors, (959), 721 states have internal predecessors, (959), 0 states have call successors, (0), 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:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 959 transitions. [2022-01-10 21:41:47,678 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 959 transitions. Word has length 33 [2022-01-10 21:41:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:47,679 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 959 transitions. [2022-01-10 21:41:47,679 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:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 959 transitions. [2022-01-10 21:41:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:47,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:47,680 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:47,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 21:41:47,680 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1817715671, now seen corresponding path program 1 times [2022-01-10 21:41:47,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:47,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002031358] [2022-01-10 21:41:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:47,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:47,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:47,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:47,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002031358] [2022-01-10 21:41:47,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002031358] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:47,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:47,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:41:47,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193560243] [2022-01-10 21:41:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:47,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:41:47,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:41:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:41:47,714 INFO L87 Difference]: Start difference. First operand 722 states and 959 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:47,778 INFO L93 Difference]: Finished difference Result 735 states and 971 transitions. [2022-01-10 21:41:47,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:41:47,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:47,781 INFO L225 Difference]: With dead ends: 735 [2022-01-10 21:41:47,781 INFO L226 Difference]: Without dead ends: 714 [2022-01-10 21:41:47,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:47,781 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 33 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:47,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 3046 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-10 21:41:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2022-01-10 21:41:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 701 states have (on average 1.3523537803138375) internal successors, (948), 713 states have internal predecessors, (948), 0 states have call successors, (0), 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:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 948 transitions. [2022-01-10 21:41:47,815 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 948 transitions. Word has length 34 [2022-01-10 21:41:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:47,816 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 948 transitions. [2022-01-10 21:41:47,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 948 transitions. [2022-01-10 21:41:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:47,816 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:47,816 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:47,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 21:41:47,817 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:47,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1019904945, now seen corresponding path program 1 times [2022-01-10 21:41:47,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:47,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372202946] [2022-01-10 21:41:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:47,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:47,845 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:47,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:47,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372202946] [2022-01-10 21:41:47,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372202946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:47,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:47,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:47,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985067134] [2022-01-10 21:41:47,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:47,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:47,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:47,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:47,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:47,846 INFO L87 Difference]: Start difference. First operand 714 states and 948 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:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:48,033 INFO L93 Difference]: Finished difference Result 848 states and 1118 transitions. [2022-01-10 21:41:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:48,033 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:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:48,035 INFO L225 Difference]: With dead ends: 848 [2022-01-10 21:41:48,036 INFO L226 Difference]: Without dead ends: 836 [2022-01-10 21:41:48,036 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:48,036 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 914 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:48,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 1058 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-01-10 21:41:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 714. [2022-01-10 21:41:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 701 states have (on average 1.3495007132667618) internal successors, (946), 713 states have internal predecessors, (946), 0 states have call successors, (0), 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:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 946 transitions. [2022-01-10 21:41:48,090 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 946 transitions. Word has length 34 [2022-01-10 21:41:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:48,090 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 946 transitions. [2022-01-10 21:41:48,090 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:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 946 transitions. [2022-01-10 21:41:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:48,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:48,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, 1, 1, 1, 1] [2022-01-10 21:41:48,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 21:41:48,091 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -123425840, now seen corresponding path program 1 times [2022-01-10 21:41:48,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344183689] [2022-01-10 21:41:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:48,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:48,149 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:48,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344183689] [2022-01-10 21:41:48,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344183689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:48,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:48,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:48,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763583111] [2022-01-10 21:41:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:48,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:48,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:48,150 INFO L87 Difference]: Start difference. First operand 714 states and 946 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:48,233 INFO L93 Difference]: Finished difference Result 732 states and 963 transitions. [2022-01-10 21:41:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:48,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:48,236 INFO L225 Difference]: With dead ends: 732 [2022-01-10 21:41:48,236 INFO L226 Difference]: Without dead ends: 714 [2022-01-10 21:41:48,236 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:48,237 INFO L933 BasicCegarLoop]: 599 mSDtfsCounter, 21 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:48,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 2370 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-10 21:41:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2022-01-10 21:41:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 701 states have (on average 1.3352353780313837) internal successors, (936), 713 states have internal predecessors, (936), 0 states have call successors, (0), 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:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 936 transitions. [2022-01-10 21:41:48,283 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 936 transitions. Word has length 34 [2022-01-10 21:41:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:48,284 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 936 transitions. [2022-01-10 21:41:48,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 936 transitions. [2022-01-10 21:41:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:48,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:48,285 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:48,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 21:41:48,285 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:48,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1971810884, now seen corresponding path program 1 times [2022-01-10 21:41:48,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:48,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754492957] [2022-01-10 21:41:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:48,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:48,338 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:48,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:48,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754492957] [2022-01-10 21:41:48,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754492957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:48,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:48,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:48,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855011910] [2022-01-10 21:41:48,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:48,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:48,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:48,339 INFO L87 Difference]: Start difference. First operand 714 states and 936 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:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:48,477 INFO L93 Difference]: Finished difference Result 924 states and 1214 transitions. [2022-01-10 21:41:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:48,478 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:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:48,479 INFO L225 Difference]: With dead ends: 924 [2022-01-10 21:41:48,479 INFO L226 Difference]: Without dead ends: 716 [2022-01-10 21:41:48,480 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:48,480 INFO L933 BasicCegarLoop]: 606 mSDtfsCounter, 27 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:48,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1059 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-01-10 21:41:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2022-01-10 21:41:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 705 states have (on average 1.3319148936170213) internal successors, (939), 715 states have internal predecessors, (939), 0 states have call successors, (0), 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:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 939 transitions. [2022-01-10 21:41:48,520 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 939 transitions. Word has length 34 [2022-01-10 21:41:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:48,520 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 939 transitions. [2022-01-10 21:41:48,520 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:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 939 transitions. [2022-01-10 21:41:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:48,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:48,521 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:48,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 21:41:48,521 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:48,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2029910308, now seen corresponding path program 1 times [2022-01-10 21:41:48,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:48,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189721228] [2022-01-10 21:41:48,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:48,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:48,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:48,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:48,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189721228] [2022-01-10 21:41:48,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189721228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:48,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:48,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:48,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479903599] [2022-01-10 21:41:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:48,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:48,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:48,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:48,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:48,547 INFO L87 Difference]: Start difference. First operand 716 states and 939 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:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:48,599 INFO L93 Difference]: Finished difference Result 897 states and 1170 transitions. [2022-01-10 21:41:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:48,599 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:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:48,601 INFO L225 Difference]: With dead ends: 897 [2022-01-10 21:41:48,601 INFO L226 Difference]: Without dead ends: 692 [2022-01-10 21:41:48,601 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:48,602 INFO L933 BasicCegarLoop]: 596 mSDtfsCounter, 201 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:48,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 979 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-01-10 21:41:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 676. [2022-01-10 21:41:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 665 states have (on average 1.324812030075188) internal successors, (881), 675 states have internal predecessors, (881), 0 states have call successors, (0), 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:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 881 transitions. [2022-01-10 21:41:48,637 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 881 transitions. Word has length 34 [2022-01-10 21:41:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:48,637 INFO L470 AbstractCegarLoop]: Abstraction has 676 states and 881 transitions. [2022-01-10 21:41:48,637 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:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 881 transitions. [2022-01-10 21:41:48,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:48,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:48,638 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:48,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 21:41:48,638 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:48,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:48,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1521496466, now seen corresponding path program 1 times [2022-01-10 21:41:48,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:48,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789750540] [2022-01-10 21:41:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:48,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:48,667 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:48,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:48,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789750540] [2022-01-10 21:41:48,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789750540] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:48,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:48,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:48,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053130208] [2022-01-10 21:41:48,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:48,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:48,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:48,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:48,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:48,668 INFO L87 Difference]: Start difference. First operand 676 states and 881 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:48,817 INFO L93 Difference]: Finished difference Result 798 states and 1040 transitions. [2022-01-10 21:41:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:48,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:48,819 INFO L225 Difference]: With dead ends: 798 [2022-01-10 21:41:48,820 INFO L226 Difference]: Without dead ends: 795 [2022-01-10 21:41:48,820 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:48,821 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 886 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:48,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 1026 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-01-10 21:41:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 678. [2022-01-10 21:41:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 667 states have (on average 1.3238380809595203) internal successors, (883), 677 states have internal predecessors, (883), 0 states have call successors, (0), 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:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 883 transitions. [2022-01-10 21:41:48,867 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 883 transitions. Word has length 35 [2022-01-10 21:41:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:48,867 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 883 transitions. [2022-01-10 21:41:48,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 883 transitions. [2022-01-10 21:41:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:48,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:48,868 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:48,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 21:41:48,868 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1521497491, now seen corresponding path program 1 times [2022-01-10 21:41:48,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:48,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943999317] [2022-01-10 21:41:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:48,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:48,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:48,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:48,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943999317] [2022-01-10 21:41:48,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943999317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:48,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:48,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:48,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585031095] [2022-01-10 21:41:48,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:48,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:48,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:48,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:48,905 INFO L87 Difference]: Start difference. First operand 678 states and 883 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:49,036 INFO L93 Difference]: Finished difference Result 687 states and 890 transitions. [2022-01-10 21:41:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:49,038 INFO L225 Difference]: With dead ends: 687 [2022-01-10 21:41:49,038 INFO L226 Difference]: Without dead ends: 626 [2022-01-10 21:41:49,038 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:49,038 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 643 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:49,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 867 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-01-10 21:41:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-01-10 21:41:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 615 states have (on average 1.326829268292683) internal successors, (816), 625 states have internal predecessors, (816), 0 states have call successors, (0), 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:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 816 transitions. [2022-01-10 21:41:49,095 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 816 transitions. Word has length 35 [2022-01-10 21:41:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:49,095 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 816 transitions. [2022-01-10 21:41:49,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 816 transitions. [2022-01-10 21:41:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:49,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:49,096 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:49,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 21:41:49,096 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 279905416, now seen corresponding path program 1 times [2022-01-10 21:41:49,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:49,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564914926] [2022-01-10 21:41:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:49,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:49,118 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:49,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:49,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564914926] [2022-01-10 21:41:49,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564914926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:49,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:49,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:49,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811429272] [2022-01-10 21:41:49,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:49,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:49,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:49,119 INFO L87 Difference]: Start difference. First operand 626 states and 816 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:49,247 INFO L93 Difference]: Finished difference Result 1205 states and 1562 transitions. [2022-01-10 21:41:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:49,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:49,249 INFO L225 Difference]: With dead ends: 1205 [2022-01-10 21:41:49,249 INFO L226 Difference]: Without dead ends: 927 [2022-01-10 21:41:49,250 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:49,250 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 233 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:49,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1051 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-01-10 21:41:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 663. [2022-01-10 21:41:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 652 states have (on average 1.3282208588957056) internal successors, (866), 662 states have internal predecessors, (866), 0 states have call successors, (0), 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:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 866 transitions. [2022-01-10 21:41:49,299 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 866 transitions. Word has length 35 [2022-01-10 21:41:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:49,300 INFO L470 AbstractCegarLoop]: Abstraction has 663 states and 866 transitions. [2022-01-10 21:41:49,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 866 transitions. [2022-01-10 21:41:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:49,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:49,300 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:49,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 21:41:49,301 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:49,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash 408988135, now seen corresponding path program 1 times [2022-01-10 21:41:49,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:49,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993564006] [2022-01-10 21:41:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:49,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:49,325 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:49,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:49,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993564006] [2022-01-10 21:41:49,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993564006] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:49,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:49,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:49,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715274647] [2022-01-10 21:41:49,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:49,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:49,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:49,327 INFO L87 Difference]: Start difference. First operand 663 states and 866 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:49,449 INFO L93 Difference]: Finished difference Result 735 states and 947 transitions. [2022-01-10 21:41:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:49,450 INFO L225 Difference]: With dead ends: 735 [2022-01-10 21:41:49,451 INFO L226 Difference]: Without dead ends: 646 [2022-01-10 21:41:49,451 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:49,451 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 619 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:49,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 882 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-01-10 21:41:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 628. [2022-01-10 21:41:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 617 states have (on average 1.306320907617504) internal successors, (806), 627 states have internal predecessors, (806), 0 states have call successors, (0), 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:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 806 transitions. [2022-01-10 21:41:49,496 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 806 transitions. Word has length 35 [2022-01-10 21:41:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:49,496 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 806 transitions. [2022-01-10 21:41:49,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 806 transitions. [2022-01-10 21:41:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:49,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:49,497 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:49,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 21:41:49,497 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:49,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash 244667847, now seen corresponding path program 1 times [2022-01-10 21:41:49,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:49,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64835525] [2022-01-10 21:41:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:49,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:49,521 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:49,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:49,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64835525] [2022-01-10 21:41:49,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64835525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:49,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:49,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:49,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441106673] [2022-01-10 21:41:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:49,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:49,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:49,522 INFO L87 Difference]: Start difference. First operand 628 states and 806 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:49,629 INFO L93 Difference]: Finished difference Result 711 states and 904 transitions. [2022-01-10 21:41:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:49,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:49,631 INFO L225 Difference]: With dead ends: 711 [2022-01-10 21:41:49,631 INFO L226 Difference]: Without dead ends: 691 [2022-01-10 21:41:49,632 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:49,632 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 111 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:49,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 1047 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-01-10 21:41:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 632. [2022-01-10 21:41:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 621 states have (on average 1.2995169082125604) internal successors, (807), 631 states have internal predecessors, (807), 0 states have call successors, (0), 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:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 807 transitions. [2022-01-10 21:41:49,681 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 807 transitions. Word has length 35 [2022-01-10 21:41:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:49,681 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 807 transitions. [2022-01-10 21:41:49,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 807 transitions. [2022-01-10 21:41:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:49,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:49,682 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:49,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 21:41:49,682 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:49,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1068309615, now seen corresponding path program 1 times [2022-01-10 21:41:49,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:49,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430027639] [2022-01-10 21:41:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:49,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:49,715 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:49,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:49,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430027639] [2022-01-10 21:41:49,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430027639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:49,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:49,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:49,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626177964] [2022-01-10 21:41:49,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:49,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:49,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:49,716 INFO L87 Difference]: Start difference. First operand 632 states and 807 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:49,781 INFO L93 Difference]: Finished difference Result 650 states and 824 transitions. [2022-01-10 21:41:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:49,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:49,783 INFO L225 Difference]: With dead ends: 650 [2022-01-10 21:41:49,783 INFO L226 Difference]: Without dead ends: 632 [2022-01-10 21:41:49,783 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:49,784 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 21 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:49,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 2168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-01-10 21:41:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2022-01-10 21:41:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 621 states have (on average 1.2946859903381642) internal successors, (804), 631 states have internal predecessors, (804), 0 states have call successors, (0), 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:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 804 transitions. [2022-01-10 21:41:49,820 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 804 transitions. Word has length 35 [2022-01-10 21:41:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:49,820 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 804 transitions. [2022-01-10 21:41:49,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 804 transitions. [2022-01-10 21:41:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:49,821 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:49,821 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:49,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 21:41:49,821 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2065381968, now seen corresponding path program 1 times [2022-01-10 21:41:49,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:49,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502554702] [2022-01-10 21:41:49,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:49,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:49,850 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:49,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502554702] [2022-01-10 21:41:49,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502554702] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:49,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:49,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:49,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130406484] [2022-01-10 21:41:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:49,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:49,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:49,851 INFO L87 Difference]: Start difference. First operand 632 states and 804 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:49,915 INFO L93 Difference]: Finished difference Result 648 states and 819 transitions. [2022-01-10 21:41:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:49,917 INFO L225 Difference]: With dead ends: 648 [2022-01-10 21:41:49,917 INFO L226 Difference]: Without dead ends: 622 [2022-01-10 21:41:49,917 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:49,918 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 544 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:49,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 1638 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-01-10 21:41:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2022-01-10 21:41:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 611 states have (on average 1.292962356792144) internal successors, (790), 621 states have internal predecessors, (790), 0 states have call successors, (0), 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:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 790 transitions. [2022-01-10 21:41:49,979 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 790 transitions. Word has length 35 [2022-01-10 21:41:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:49,979 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 790 transitions. [2022-01-10 21:41:49,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 790 transitions. [2022-01-10 21:41:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:49,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:49,980 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:49,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 21:41:49,980 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash 625854752, now seen corresponding path program 1 times [2022-01-10 21:41:49,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:49,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96888383] [2022-01-10 21:41:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:49,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:50,012 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:50,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:50,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96888383] [2022-01-10 21:41:50,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96888383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:50,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:50,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:50,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471716345] [2022-01-10 21:41:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:50,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:50,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:50,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:50,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:50,014 INFO L87 Difference]: Start difference. First operand 622 states and 790 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:50,123 INFO L93 Difference]: Finished difference Result 682 states and 851 transitions. [2022-01-10 21:41:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:50,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:50,126 INFO L225 Difference]: With dead ends: 682 [2022-01-10 21:41:50,126 INFO L226 Difference]: Without dead ends: 659 [2022-01-10 21:41:50,127 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:50,127 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 71 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:50,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 2139 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-01-10 21:41:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 625. [2022-01-10 21:41:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 614 states have (on average 1.291530944625407) internal successors, (793), 624 states have internal predecessors, (793), 0 states have call successors, (0), 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:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 793 transitions. [2022-01-10 21:41:50,168 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 793 transitions. Word has length 35 [2022-01-10 21:41:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:50,168 INFO L470 AbstractCegarLoop]: Abstraction has 625 states and 793 transitions. [2022-01-10 21:41:50,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 793 transitions. [2022-01-10 21:41:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:50,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:50,169 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:50,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 21:41:50,169 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:50,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1004212208, now seen corresponding path program 1 times [2022-01-10 21:41:50,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:50,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800621135] [2022-01-10 21:41:50,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:50,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:50,199 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:50,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800621135] [2022-01-10 21:41:50,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800621135] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:50,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:50,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:50,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52534793] [2022-01-10 21:41:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:50,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:50,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:50,200 INFO L87 Difference]: Start difference. First operand 625 states and 793 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:50,369 INFO L93 Difference]: Finished difference Result 684 states and 868 transitions. [2022-01-10 21:41:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:50,371 INFO L225 Difference]: With dead ends: 684 [2022-01-10 21:41:50,372 INFO L226 Difference]: Without dead ends: 681 [2022-01-10 21:41:50,372 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:50,372 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 629 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:50,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 992 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-01-10 21:41:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 623. [2022-01-10 21:41:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 612 states have (on average 1.2908496732026145) internal successors, (790), 622 states have internal predecessors, (790), 0 states have call successors, (0), 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:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 790 transitions. [2022-01-10 21:41:50,457 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 790 transitions. Word has length 36 [2022-01-10 21:41:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:50,457 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 790 transitions. [2022-01-10 21:41:50,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 790 transitions. [2022-01-10 21:41:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:50,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:50,457 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:50,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 21:41:50,458 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1004211183, now seen corresponding path program 1 times [2022-01-10 21:41:50,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:50,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371694987] [2022-01-10 21:41:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:50,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:50,530 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:50,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:50,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371694987] [2022-01-10 21:41:50,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371694987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:50,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:50,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:50,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404038484] [2022-01-10 21:41:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:50,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:50,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:50,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:50,532 INFO L87 Difference]: Start difference. First operand 623 states and 790 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:50,786 INFO L93 Difference]: Finished difference Result 907 states and 1134 transitions. [2022-01-10 21:41:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:50,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:50,789 INFO L225 Difference]: With dead ends: 907 [2022-01-10 21:41:50,789 INFO L226 Difference]: Without dead ends: 884 [2022-01-10 21:41:50,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 21:41:50,790 INFO L933 BasicCegarLoop]: 515 mSDtfsCounter, 585 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:50,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 2502 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-01-10 21:41:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 621. [2022-01-10 21:41:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 610 states have (on average 1.2885245901639344) internal successors, (786), 620 states have internal predecessors, (786), 0 states have call successors, (0), 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:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 786 transitions. [2022-01-10 21:41:50,832 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 786 transitions. Word has length 36 [2022-01-10 21:41:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:50,832 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 786 transitions. [2022-01-10 21:41:50,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 786 transitions. [2022-01-10 21:41:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 21:41:50,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:50,833 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:50,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 21:41:50,833 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 146401930, now seen corresponding path program 1 times [2022-01-10 21:41:50,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:50,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068998753] [2022-01-10 21:41:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:50,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:50,882 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:50,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:50,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068998753] [2022-01-10 21:41:50,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068998753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:50,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:50,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:41:50,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259930793] [2022-01-10 21:41:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:50,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:41:50,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:41:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:41:50,883 INFO L87 Difference]: Start difference. First operand 621 states and 786 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,091 INFO L93 Difference]: Finished difference Result 656 states and 818 transitions. [2022-01-10 21:41:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:51,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,093 INFO L225 Difference]: With dead ends: 656 [2022-01-10 21:41:51,093 INFO L226 Difference]: Without dead ends: 615 [2022-01-10 21:41:51,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:51,094 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 364 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 2199 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-01-10 21:41:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 590. [2022-01-10 21:41:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 579 states have (on average 1.293609671848014) internal successors, (749), 589 states have internal predecessors, (749), 0 states have call successors, (0), 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:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2022-01-10 21:41:51,149 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 749 transitions. Word has length 37 [2022-01-10 21:41:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,149 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 749 transitions. [2022-01-10 21:41:51,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 749 transitions. [2022-01-10 21:41:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 21:41:51,150 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,150 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:51,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 21:41:51,150 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash -558530402, now seen corresponding path program 1 times [2022-01-10 21:41:51,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559455101] [2022-01-10 21:41:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,180 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:51,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559455101] [2022-01-10 21:41:51,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559455101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:51,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275001253] [2022-01-10 21:41:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:51,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:51,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:51,181 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,243 INFO L93 Difference]: Finished difference Result 853 states and 1087 transitions. [2022-01-10 21:41:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:51,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:51,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,245 INFO L225 Difference]: With dead ends: 853 [2022-01-10 21:41:51,245 INFO L226 Difference]: Without dead ends: 652 [2022-01-10 21:41:51,246 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:51,246 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 174 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 901 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:51,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 901 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:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-01-10 21:41:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 578. [2022-01-10 21:41:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 570 states have (on average 1.2824561403508772) internal successors, (731), 577 states have internal predecessors, (731), 0 states have call successors, (0), 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:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 731 transitions. [2022-01-10 21:41:51,288 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 731 transitions. Word has length 37 [2022-01-10 21:41:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,288 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 731 transitions. [2022-01-10 21:41:51,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 731 transitions. [2022-01-10 21:41:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 21:41:51,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,289 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:51,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 21:41:51,289 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:51,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1895054399, now seen corresponding path program 1 times [2022-01-10 21:41:51,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265126272] [2022-01-10 21:41:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,334 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:51,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265126272] [2022-01-10 21:41:51,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265126272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:51,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214107906] [2022-01-10 21:41:51,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:51,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:51,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:51,336 INFO L87 Difference]: Start difference. First operand 578 states and 731 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:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,408 INFO L93 Difference]: Finished difference Result 777 states and 984 transitions. [2022-01-10 21:41:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:51,408 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:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,410 INFO L225 Difference]: With dead ends: 777 [2022-01-10 21:41:51,410 INFO L226 Difference]: Without dead ends: 560 [2022-01-10 21:41:51,410 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:51,411 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 352 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-01-10 21:41:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 544. [2022-01-10 21:41:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 537 states have (on average 1.2681564245810055) internal successors, (681), 543 states have internal predecessors, (681), 0 states have call successors, (0), 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:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 681 transitions. [2022-01-10 21:41:51,465 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 681 transitions. Word has length 39 [2022-01-10 21:41:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,465 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 681 transitions. [2022-01-10 21:41:51,465 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:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 681 transitions. [2022-01-10 21:41:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 21:41:51,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,466 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:51,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 21:41:51,466 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1992316235, now seen corresponding path program 1 times [2022-01-10 21:41:51,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605238871] [2022-01-10 21:41:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,502 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:51,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605238871] [2022-01-10 21:41:51,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605238871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:41:51,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617519178] [2022-01-10 21:41:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:41:51,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:41:51,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:41:51,503 INFO L87 Difference]: Start difference. First operand 544 states and 681 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,591 INFO L93 Difference]: Finished difference Result 578 states and 714 transitions. [2022-01-10 21:41:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:41:51,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,593 INFO L225 Difference]: With dead ends: 578 [2022-01-10 21:41:51,593 INFO L226 Difference]: Without dead ends: 559 [2022-01-10 21:41:51,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:51,594 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 57 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 2354 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-01-10 21:41:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 541. [2022-01-10 21:41:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 534 states have (on average 1.2677902621722847) internal successors, (677), 540 states have internal predecessors, (677), 0 states have call successors, (0), 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:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 677 transitions. [2022-01-10 21:41:51,635 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 677 transitions. Word has length 40 [2022-01-10 21:41:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,635 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 677 transitions. [2022-01-10 21:41:51,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 677 transitions. [2022-01-10 21:41:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 21:41:51,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,636 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:51,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 21:41:51,636 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash -90280893, now seen corresponding path program 1 times [2022-01-10 21:41:51,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650417312] [2022-01-10 21:41:51,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,669 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:51,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650417312] [2022-01-10 21:41:51,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650417312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:51,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820315389] [2022-01-10 21:41:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:51,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:51,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:51,670 INFO L87 Difference]: Start difference. First operand 541 states and 677 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:51,742 INFO L93 Difference]: Finished difference Result 570 states and 705 transitions. [2022-01-10 21:41:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:51,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:51,743 INFO L225 Difference]: With dead ends: 570 [2022-01-10 21:41:51,743 INFO L226 Difference]: Without dead ends: 550 [2022-01-10 21:41:51,744 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:51,744 INFO L933 BasicCegarLoop]: 482 mSDtfsCounter, 43 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:51,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1889 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-01-10 21:41:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 537. [2022-01-10 21:41:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 530 states have (on average 1.2660377358490567) internal successors, (671), 536 states have internal predecessors, (671), 0 states have call successors, (0), 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:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 671 transitions. [2022-01-10 21:41:51,803 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 671 transitions. Word has length 40 [2022-01-10 21:41:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:51,803 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 671 transitions. [2022-01-10 21:41:51,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 671 transitions. [2022-01-10 21:41:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 21:41:51,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:51,804 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:51,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 21:41:51,804 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1378449928, now seen corresponding path program 1 times [2022-01-10 21:41:51,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:51,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140326183] [2022-01-10 21:41:51,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:51,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:51,861 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:51,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:51,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140326183] [2022-01-10 21:41:51,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140326183] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:51,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:51,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:51,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92732577] [2022-01-10 21:41:51,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:51,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:51,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:51,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:51,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:51,863 INFO L87 Difference]: Start difference. First operand 537 states and 671 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:52,128 INFO L93 Difference]: Finished difference Result 793 states and 981 transitions. [2022-01-10 21:41:52,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:52,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:52,130 INFO L225 Difference]: With dead ends: 793 [2022-01-10 21:41:52,130 INFO L226 Difference]: Without dead ends: 776 [2022-01-10 21:41:52,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 21:41:52,130 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 357 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:52,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 2640 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-01-10 21:41:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 536. [2022-01-10 21:41:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 529 states have (on average 1.2646502835538753) internal successors, (669), 535 states have internal predecessors, (669), 0 states have call successors, (0), 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:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 669 transitions. [2022-01-10 21:41:52,172 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 669 transitions. Word has length 41 [2022-01-10 21:41:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:52,173 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 669 transitions. [2022-01-10 21:41:52,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 669 transitions. [2022-01-10 21:41:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 21:41:52,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:52,173 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:52,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 21:41:52,174 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1406972086, now seen corresponding path program 1 times [2022-01-10 21:41:52,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:52,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072519359] [2022-01-10 21:41:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:52,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:52,215 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:52,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:52,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072519359] [2022-01-10 21:41:52,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072519359] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:52,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:52,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:52,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505976199] [2022-01-10 21:41:52,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:52,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:52,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:52,216 INFO L87 Difference]: Start difference. First operand 536 states and 669 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:52,333 INFO L93 Difference]: Finished difference Result 719 states and 904 transitions. [2022-01-10 21:41:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:52,334 INFO L225 Difference]: With dead ends: 719 [2022-01-10 21:41:52,334 INFO L226 Difference]: Without dead ends: 536 [2022-01-10 21:41:52,335 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:52,335 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 470 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:52,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 789 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-01-10 21:41:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2022-01-10 21:41:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 529 states have (on average 1.2533081285444234) internal successors, (663), 535 states have internal predecessors, (663), 0 states have call successors, (0), 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:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 663 transitions. [2022-01-10 21:41:52,377 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 663 transitions. Word has length 41 [2022-01-10 21:41:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:52,377 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 663 transitions. [2022-01-10 21:41:52,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 663 transitions. [2022-01-10 21:41:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 21:41:52,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:52,378 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:52,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 21:41:52,378 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -835760323, now seen corresponding path program 1 times [2022-01-10 21:41:52,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:52,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908255035] [2022-01-10 21:41:52,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:52,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:52,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:52,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:52,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908255035] [2022-01-10 21:41:52,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908255035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:52,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:52,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:41:52,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9375490] [2022-01-10 21:41:52,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:52,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:41:52,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:41:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:41:52,427 INFO L87 Difference]: Start difference. First operand 536 states and 663 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:52,653 INFO L93 Difference]: Finished difference Result 568 states and 691 transitions. [2022-01-10 21:41:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:52,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:52,655 INFO L225 Difference]: With dead ends: 568 [2022-01-10 21:41:52,655 INFO L226 Difference]: Without dead ends: 544 [2022-01-10 21:41:52,655 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:52,655 INFO L933 BasicCegarLoop]: 471 mSDtfsCounter, 340 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:52,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 1981 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-01-10 21:41:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 523. [2022-01-10 21:41:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 516 states have (on average 1.255813953488372) internal successors, (648), 522 states have internal predecessors, (648), 0 states have call successors, (0), 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:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 648 transitions. [2022-01-10 21:41:52,697 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 648 transitions. Word has length 42 [2022-01-10 21:41:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:52,697 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 648 transitions. [2022-01-10 21:41:52,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 648 transitions. [2022-01-10 21:41:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:52,698 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:52,698 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:52,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 21:41:52,698 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash -587888533, now seen corresponding path program 1 times [2022-01-10 21:41:52,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:52,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565761266] [2022-01-10 21:41:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:52,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:52,727 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:52,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:52,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565761266] [2022-01-10 21:41:52,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565761266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:52,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:52,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:52,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573215603] [2022-01-10 21:41:52,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:52,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:52,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:52,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:52,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:52,728 INFO L87 Difference]: Start difference. First operand 523 states and 648 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:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:52,805 INFO L93 Difference]: Finished difference Result 756 states and 912 transitions. [2022-01-10 21:41:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:52,805 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:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:52,807 INFO L225 Difference]: With dead ends: 756 [2022-01-10 21:41:52,807 INFO L226 Difference]: Without dead ends: 682 [2022-01-10 21:41:52,807 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:52,808 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 114 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:52,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 1498 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-01-10 21:41:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 527. [2022-01-10 21:41:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 520 states have (on average 1.2538461538461538) internal successors, (652), 526 states have internal predecessors, (652), 0 states have call successors, (0), 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:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 652 transitions. [2022-01-10 21:41:52,851 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 652 transitions. Word has length 44 [2022-01-10 21:41:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:52,852 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 652 transitions. [2022-01-10 21:41:52,852 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:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 652 transitions. [2022-01-10 21:41:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:52,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:52,852 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:52,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 21:41:52,853 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1865534539, now seen corresponding path program 1 times [2022-01-10 21:41:52,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:52,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842631525] [2022-01-10 21:41:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:52,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:52,895 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:52,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:52,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842631525] [2022-01-10 21:41:52,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842631525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:52,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:52,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:52,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776817420] [2022-01-10 21:41:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:52,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:52,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:52,897 INFO L87 Difference]: Start difference. First operand 527 states and 652 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:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:53,010 INFO L93 Difference]: Finished difference Result 741 states and 891 transitions. [2022-01-10 21:41:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:53,011 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:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:53,012 INFO L225 Difference]: With dead ends: 741 [2022-01-10 21:41:53,012 INFO L226 Difference]: Without dead ends: 586 [2022-01-10 21:41:53,012 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:53,013 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 238 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:53,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 2817 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-01-10 21:41:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 530. [2022-01-10 21:41:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 523 states have (on average 1.248565965583174) internal successors, (653), 529 states have internal predecessors, (653), 0 states have call successors, (0), 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:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 653 transitions. [2022-01-10 21:41:53,067 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 653 transitions. Word has length 44 [2022-01-10 21:41:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:53,067 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 653 transitions. [2022-01-10 21:41:53,067 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:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 653 transitions. [2022-01-10 21:41:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:53,067 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:53,068 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:53,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-10 21:41:53,068 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:53,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1372031769, now seen corresponding path program 1 times [2022-01-10 21:41:53,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:53,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128318969] [2022-01-10 21:41:53,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:53,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:53,114 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:53,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:53,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128318969] [2022-01-10 21:41:53,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128318969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:53,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:53,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:41:53,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505509385] [2022-01-10 21:41:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:53,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:41:53,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:41:53,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:41:53,116 INFO L87 Difference]: Start difference. First operand 530 states and 653 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:53,209 INFO L93 Difference]: Finished difference Result 543 states and 665 transitions. [2022-01-10 21:41:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:53,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:53,211 INFO L225 Difference]: With dead ends: 543 [2022-01-10 21:41:53,211 INFO L226 Difference]: Without dead ends: 521 [2022-01-10 21:41:53,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:41:53,211 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 93 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:53,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 2239 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-01-10 21:41:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2022-01-10 21:41:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 514 states have (on average 1.2490272373540856) internal successors, (642), 520 states have internal predecessors, (642), 0 states have call successors, (0), 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:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 642 transitions. [2022-01-10 21:41:53,256 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 642 transitions. Word has length 44 [2022-01-10 21:41:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:53,256 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 642 transitions. [2022-01-10 21:41:53,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 642 transitions. [2022-01-10 21:41:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:53,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:53,256 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:53,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-10 21:41:53,257 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:53,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1251604863, now seen corresponding path program 1 times [2022-01-10 21:41:53,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:53,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141454075] [2022-01-10 21:41:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:53,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:53,292 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:53,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:53,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141454075] [2022-01-10 21:41:53,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141454075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:53,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:53,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:53,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551274584] [2022-01-10 21:41:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:53,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:53,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:53,294 INFO L87 Difference]: Start difference. First operand 521 states and 642 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:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:53,351 INFO L93 Difference]: Finished difference Result 539 states and 659 transitions. [2022-01-10 21:41:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:53,351 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:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:53,352 INFO L225 Difference]: With dead ends: 539 [2022-01-10 21:41:53,352 INFO L226 Difference]: Without dead ends: 520 [2022-01-10 21:41:53,353 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:53,353 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 134 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:53,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 1324 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-01-10 21:41:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 506. [2022-01-10 21:41:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 499 states have (on average 1.25250501002004) internal successors, (625), 505 states have internal predecessors, (625), 0 states have call successors, (0), 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:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 625 transitions. [2022-01-10 21:41:53,395 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 625 transitions. Word has length 44 [2022-01-10 21:41:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:53,396 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 625 transitions. [2022-01-10 21:41:53,396 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:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 625 transitions. [2022-01-10 21:41:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:53,399 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:53,399 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:53,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-10 21:41:53,399 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash 151969797, now seen corresponding path program 1 times [2022-01-10 21:41:53,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:53,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717429712] [2022-01-10 21:41:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:53,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:53,427 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:53,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:53,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717429712] [2022-01-10 21:41:53,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717429712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:53,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:53,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:53,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709848726] [2022-01-10 21:41:53,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:53,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:53,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:53,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:53,428 INFO L87 Difference]: Start difference. First operand 506 states and 625 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:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:53,540 INFO L93 Difference]: Finished difference Result 859 states and 1059 transitions. [2022-01-10 21:41:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:53,540 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:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:53,541 INFO L225 Difference]: With dead ends: 859 [2022-01-10 21:41:53,541 INFO L226 Difference]: Without dead ends: 676 [2022-01-10 21:41:53,542 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:53,542 INFO L933 BasicCegarLoop]: 610 mSDtfsCounter, 172 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:53,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 1010 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-01-10 21:41:53,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 506. [2022-01-10 21:41:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 499 states have (on average 1.25250501002004) internal successors, (625), 505 states have internal predecessors, (625), 0 states have call successors, (0), 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:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 625 transitions. [2022-01-10 21:41:53,586 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 625 transitions. Word has length 44 [2022-01-10 21:41:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:53,586 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 625 transitions. [2022-01-10 21:41:53,586 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:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 625 transitions. [2022-01-10 21:41:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 21:41:53,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:53,587 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:53,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-10 21:41:53,587 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1841495067, now seen corresponding path program 1 times [2022-01-10 21:41:53,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:53,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929403251] [2022-01-10 21:41:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:53,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:53,675 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:53,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:53,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929403251] [2022-01-10 21:41:53,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929403251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:53,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:53,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:53,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392035728] [2022-01-10 21:41:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:53,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:53,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:53,677 INFO L87 Difference]: Start difference. First operand 506 states and 625 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:53,887 INFO L93 Difference]: Finished difference Result 807 states and 992 transitions. [2022-01-10 21:41:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:41:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:53,888 INFO L225 Difference]: With dead ends: 807 [2022-01-10 21:41:53,888 INFO L226 Difference]: Without dead ends: 649 [2022-01-10 21:41:53,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:53,889 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 343 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:53,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 1985 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-01-10 21:41:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 506. [2022-01-10 21:41:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 499 states have (on average 1.2444889779559118) internal successors, (621), 505 states have internal predecessors, (621), 0 states have call successors, (0), 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:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 621 transitions. [2022-01-10 21:41:53,935 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 621 transitions. Word has length 44 [2022-01-10 21:41:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:53,935 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 621 transitions. [2022-01-10 21:41:53,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 621 transitions. [2022-01-10 21:41:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 21:41:53,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:53,936 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:53,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-10 21:41:53,936 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash -352183888, now seen corresponding path program 1 times [2022-01-10 21:41:53,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:53,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969948498] [2022-01-10 21:41:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:53,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:53,999 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:53,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:53,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969948498] [2022-01-10 21:41:53,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969948498] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:54,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:54,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:54,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243925836] [2022-01-10 21:41:54,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:54,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:54,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:54,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:54,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:54,000 INFO L87 Difference]: Start difference. First operand 506 states and 621 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:54,272 INFO L93 Difference]: Finished difference Result 695 states and 838 transitions. [2022-01-10 21:41:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:54,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:54,273 INFO L225 Difference]: With dead ends: 695 [2022-01-10 21:41:54,274 INFO L226 Difference]: Without dead ends: 621 [2022-01-10 21:41:54,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-10 21:41:54,274 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 590 mSDsluCounter, 2101 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 2528 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:54,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 2528 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-01-10 21:41:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 507. [2022-01-10 21:41:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 500 states have (on average 1.234) internal successors, (617), 506 states have internal predecessors, (617), 0 states have call successors, (0), 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:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 617 transitions. [2022-01-10 21:41:54,321 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 617 transitions. Word has length 46 [2022-01-10 21:41:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:54,321 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 617 transitions. [2022-01-10 21:41:54,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 617 transitions. [2022-01-10 21:41:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 21:41:54,322 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:54,322 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:54,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-10 21:41:54,322 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1645543832, now seen corresponding path program 1 times [2022-01-10 21:41:54,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:54,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745995556] [2022-01-10 21:41:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:54,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:54,377 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:54,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:54,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745995556] [2022-01-10 21:41:54,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745995556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:54,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:54,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:54,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161715889] [2022-01-10 21:41:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:54,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:54,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:54,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:54,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:54,378 INFO L87 Difference]: Start difference. First operand 507 states and 617 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:54,565 INFO L93 Difference]: Finished difference Result 964 states and 1184 transitions. [2022-01-10 21:41:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:54,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:54,567 INFO L225 Difference]: With dead ends: 964 [2022-01-10 21:41:54,567 INFO L226 Difference]: Without dead ends: 833 [2022-01-10 21:41:54,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:54,568 INFO L933 BasicCegarLoop]: 707 mSDtfsCounter, 543 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:54,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 2244 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-01-10 21:41:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 507. [2022-01-10 21:41:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 500 states have (on average 1.232) internal successors, (616), 506 states have internal predecessors, (616), 0 states have call successors, (0), 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:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 616 transitions. [2022-01-10 21:41:54,625 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 616 transitions. Word has length 47 [2022-01-10 21:41:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:54,625 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 616 transitions. [2022-01-10 21:41:54,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 616 transitions. [2022-01-10 21:41:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 21:41:54,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:54,626 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:54,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-10 21:41:54,626 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1391710858, now seen corresponding path program 1 times [2022-01-10 21:41:54,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:54,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565794645] [2022-01-10 21:41:54,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:54,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:54,683 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:54,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:54,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565794645] [2022-01-10 21:41:54,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565794645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:54,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:54,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:54,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187007709] [2022-01-10 21:41:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:54,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:54,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:54,684 INFO L87 Difference]: Start difference. First operand 507 states and 616 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:54,876 INFO L93 Difference]: Finished difference Result 543 states and 650 transitions. [2022-01-10 21:41:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:54,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:54,877 INFO L225 Difference]: With dead ends: 543 [2022-01-10 21:41:54,877 INFO L226 Difference]: Without dead ends: 432 [2022-01-10 21:41:54,878 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:54,878 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 435 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:54,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 2155 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-01-10 21:41:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 401. [2022-01-10 21:41:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 394 states have (on average 1.2436548223350254) internal successors, (490), 400 states have internal predecessors, (490), 0 states have call successors, (0), 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:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 490 transitions. [2022-01-10 21:41:54,918 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 490 transitions. Word has length 47 [2022-01-10 21:41:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:54,919 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 490 transitions. [2022-01-10 21:41:54,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 490 transitions. [2022-01-10 21:41:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 21:41:54,919 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:54,919 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:54,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-10 21:41:54,920 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1078810043, now seen corresponding path program 1 times [2022-01-10 21:41:54,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:54,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487688612] [2022-01-10 21:41:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:54,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:54,949 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:54,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:54,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487688612] [2022-01-10 21:41:54,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487688612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:54,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:54,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:54,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275151545] [2022-01-10 21:41:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:54,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:54,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:54,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:54,951 INFO L87 Difference]: Start difference. First operand 401 states and 490 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:55,012 INFO L93 Difference]: Finished difference Result 491 states and 588 transitions. [2022-01-10 21:41:55,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:55,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:55,013 INFO L225 Difference]: With dead ends: 491 [2022-01-10 21:41:55,013 INFO L226 Difference]: Without dead ends: 449 [2022-01-10 21:41:55,014 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:55,014 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 117 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:55,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 1096 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-01-10 21:41:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 400. [2022-01-10 21:41:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 393 states have (on average 1.2417302798982188) internal successors, (488), 399 states have internal predecessors, (488), 0 states have call successors, (0), 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:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 488 transitions. [2022-01-10 21:41:55,056 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 488 transitions. Word has length 49 [2022-01-10 21:41:55,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:55,057 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 488 transitions. [2022-01-10 21:41:55,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 488 transitions. [2022-01-10 21:41:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 21:41:55,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:55,057 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:55,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-10 21:41:55,057 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:55,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash -174486053, now seen corresponding path program 1 times [2022-01-10 21:41:55,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:55,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110197396] [2022-01-10 21:41:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:55,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:55,101 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:55,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:55,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110197396] [2022-01-10 21:41:55,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110197396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:55,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:55,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:55,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350084803] [2022-01-10 21:41:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:55,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:55,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:55,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:55,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:55,103 INFO L87 Difference]: Start difference. First operand 400 states and 488 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:55,207 INFO L93 Difference]: Finished difference Result 470 states and 562 transitions. [2022-01-10 21:41:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:55,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:55,208 INFO L225 Difference]: With dead ends: 470 [2022-01-10 21:41:55,208 INFO L226 Difference]: Without dead ends: 399 [2022-01-10 21:41:55,208 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:55,209 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 108 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:55,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 2070 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-01-10 21:41:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 380. [2022-01-10 21:41:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 375 states have (on average 1.24) internal successors, (465), 379 states have internal predecessors, (465), 0 states have call successors, (0), 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:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 465 transitions. [2022-01-10 21:41:55,260 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 465 transitions. Word has length 49 [2022-01-10 21:41:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:55,260 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 465 transitions. [2022-01-10 21:41:55,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 465 transitions. [2022-01-10 21:41:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 21:41:55,262 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:55,262 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:55,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-10 21:41:55,263 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash 591828224, now seen corresponding path program 1 times [2022-01-10 21:41:55,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:55,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8556316] [2022-01-10 21:41:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:55,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:55,313 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:55,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:55,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8556316] [2022-01-10 21:41:55,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8556316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:55,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:55,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:55,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898593943] [2022-01-10 21:41:55,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:55,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:55,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:55,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:55,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:55,314 INFO L87 Difference]: Start difference. First operand 380 states and 465 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:55,430 INFO L93 Difference]: Finished difference Result 399 states and 483 transitions. [2022-01-10 21:41:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:55,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:55,431 INFO L225 Difference]: With dead ends: 399 [2022-01-10 21:41:55,431 INFO L226 Difference]: Without dead ends: 375 [2022-01-10 21:41:55,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-10 21:41:55,433 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 76 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:55,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 2352 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-01-10 21:41:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2022-01-10 21:41:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.2378378378378379) internal successors, (458), 374 states have internal predecessors, (458), 0 states have call successors, (0), 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:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 458 transitions. [2022-01-10 21:41:55,472 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 458 transitions. Word has length 49 [2022-01-10 21:41:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:55,472 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 458 transitions. [2022-01-10 21:41:55,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 458 transitions. [2022-01-10 21:41:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 21:41:55,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:55,474 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, 1, 1] [2022-01-10 21:41:55,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-10 21:41:55,474 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash 310167188, now seen corresponding path program 1 times [2022-01-10 21:41:55,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:55,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480633614] [2022-01-10 21:41:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:55,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:55,507 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:55,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:55,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480633614] [2022-01-10 21:41:55,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480633614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:55,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:55,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:55,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252156286] [2022-01-10 21:41:55,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:55,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:55,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:55,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:55,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:55,509 INFO L87 Difference]: Start difference. First operand 375 states and 458 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:55,581 INFO L93 Difference]: Finished difference Result 510 states and 630 transitions. [2022-01-10 21:41:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:55,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-01-10 21:41:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:55,582 INFO L225 Difference]: With dead ends: 510 [2022-01-10 21:41:55,582 INFO L226 Difference]: Without dead ends: 337 [2022-01-10 21:41:55,583 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:55,583 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 55 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:55,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 665 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-01-10 21:41:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2022-01-10 21:41:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 334 states have (on average 1.2245508982035929) internal successors, (409), 336 states have internal predecessors, (409), 0 states have call successors, (0), 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:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 409 transitions. [2022-01-10 21:41:55,617 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 409 transitions. Word has length 51 [2022-01-10 21:41:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:55,617 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 409 transitions. [2022-01-10 21:41:55,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 409 transitions. [2022-01-10 21:41:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-10 21:41:55,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:55,618 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, 1, 1, 1, 1, 1] [2022-01-10 21:41:55,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-10 21:41:55,618 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:55,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -766947984, now seen corresponding path program 1 times [2022-01-10 21:41:55,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:55,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011718037] [2022-01-10 21:41:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:55,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:55,675 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:55,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011718037] [2022-01-10 21:41:55,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011718037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:55,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:55,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:55,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620381934] [2022-01-10 21:41:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:55,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:55,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:55,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:55,677 INFO L87 Difference]: Start difference. First operand 337 states and 409 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:55,772 INFO L93 Difference]: Finished difference Result 349 states and 420 transitions. [2022-01-10 21:41:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:55,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-01-10 21:41:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:55,773 INFO L225 Difference]: With dead ends: 349 [2022-01-10 21:41:55,773 INFO L226 Difference]: Without dead ends: 290 [2022-01-10 21:41:55,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-10 21:41:55,773 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 79 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:55,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 2258 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-01-10 21:41:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-01-10 21:41:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 287 states have (on average 1.2195121951219512) internal successors, (350), 289 states have internal predecessors, (350), 0 states have call successors, (0), 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:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 350 transitions. [2022-01-10 21:41:55,810 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 350 transitions. Word has length 54 [2022-01-10 21:41:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:55,811 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 350 transitions. [2022-01-10 21:41:55,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 350 transitions. [2022-01-10 21:41:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 21:41:55,811 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:55,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:55,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-10 21:41:55,812 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1640561864, now seen corresponding path program 1 times [2022-01-10 21:41:55,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991940813] [2022-01-10 21:41:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:55,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:55,837 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:55,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:55,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991940813] [2022-01-10 21:41:55,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991940813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:55,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:55,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:55,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512128406] [2022-01-10 21:41:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:55,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:55,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:55,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:55,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:55,839 INFO L87 Difference]: Start difference. First operand 290 states and 350 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:55,890 INFO L93 Difference]: Finished difference Result 515 states and 629 transitions. [2022-01-10 21:41:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:55,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-01-10 21:41:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:55,891 INFO L225 Difference]: With dead ends: 515 [2022-01-10 21:41:55,891 INFO L226 Difference]: Without dead ends: 344 [2022-01-10 21:41:55,891 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:55,892 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 211 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:55,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 420 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-01-10 21:41:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 290. [2022-01-10 21:41:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 287 states have (on average 1.2090592334494774) internal successors, (347), 289 states have internal predecessors, (347), 0 states have call successors, (0), 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:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 347 transitions. [2022-01-10 21:41:55,924 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 347 transitions. Word has length 59 [2022-01-10 21:41:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:55,924 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 347 transitions. [2022-01-10 21:41:55,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 347 transitions. [2022-01-10 21:41:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 21:41:55,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:55,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:55,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-10 21:41:55,925 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1353722693, now seen corresponding path program 1 times [2022-01-10 21:41:55,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:55,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427650614] [2022-01-10 21:41:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:55,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:41:55,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:55,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427650614] [2022-01-10 21:41:55,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427650614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:55,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:55,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:55,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554194338] [2022-01-10 21:41:55,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:55,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:55,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:55,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:55,976 INFO L87 Difference]: Start difference. First operand 290 states and 347 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 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:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:56,118 INFO L93 Difference]: Finished difference Result 423 states and 501 transitions. [2022-01-10 21:41:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:56,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-01-10 21:41:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:56,119 INFO L225 Difference]: With dead ends: 423 [2022-01-10 21:41:56,119 INFO L226 Difference]: Without dead ends: 404 [2022-01-10 21:41:56,120 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:56,120 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 338 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:56,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 2000 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-01-10 21:41:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 284. [2022-01-10 21:41:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 281 states have (on average 1.209964412811388) internal successors, (340), 283 states have internal predecessors, (340), 0 states have call successors, (0), 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:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 340 transitions. [2022-01-10 21:41:56,153 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 340 transitions. Word has length 59 [2022-01-10 21:41:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:56,153 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 340 transitions. [2022-01-10 21:41:56,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 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:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 340 transitions. [2022-01-10 21:41:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 21:41:56,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:56,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:56,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-10 21:41:56,154 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2022-01-10 21:41:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1871621555, now seen corresponding path program 1 times [2022-01-10 21:41:56,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:56,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394266334] [2022-01-10 21:41:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:56,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 21:41:56,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 21:41:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 21:41:56,215 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 21:41:56,215 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 21:41:56,215 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (53 of 54 remaining) [2022-01-10 21:41:56,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (52 of 54 remaining) [2022-01-10 21:41:56,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (51 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (50 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (49 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (48 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (47 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (46 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (45 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (44 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (43 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (42 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (41 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (40 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (39 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (38 of 54 remaining) [2022-01-10 21:41:56,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (37 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (36 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (35 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (34 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (33 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (32 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (31 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (30 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (29 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (28 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (27 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (26 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (25 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (24 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (23 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (22 of 54 remaining) [2022-01-10 21:41:56,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (21 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (20 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (19 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (18 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (17 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (16 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (15 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (14 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (13 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (12 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (11 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (9 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (8 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (7 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (6 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (5 of 54 remaining) [2022-01-10 21:41:56,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (4 of 54 remaining) [2022-01-10 21:41:56,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (3 of 54 remaining) [2022-01-10 21:41:56,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (2 of 54 remaining) [2022-01-10 21:41:56,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (1 of 54 remaining) [2022-01-10 21:41:56,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (0 of 54 remaining) [2022-01-10 21:41:56,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-10 21:41:56,223 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:56,225 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:41:56,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:41:56 BasicIcfg [2022-01-10 21:41:56,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:41:56,716 INFO L158 Benchmark]: Toolchain (without parser) took 14904.36ms. Allocated memory was 175.1MB in the beginning and 640.7MB in the end (delta: 465.6MB). Free memory was 123.3MB in the beginning and 359.9MB in the end (delta: -236.6MB). Peak memory consumption was 369.0MB. Max. memory is 8.0GB. [2022-01-10 21:41:56,717 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 175.1MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:41:56,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.18ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 123.2MB in the beginning and 175.6MB in the end (delta: -52.4MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-01-10 21:41:56,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.28ms. Allocated memory is still 210.8MB. Free memory was 175.6MB in the beginning and 166.1MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 21:41:56,717 INFO L158 Benchmark]: Boogie Preprocessor took 80.64ms. Allocated memory is still 210.8MB. Free memory was 166.1MB in the beginning and 159.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 21:41:56,717 INFO L158 Benchmark]: RCFGBuilder took 1081.80ms. Allocated memory is still 210.8MB. Free memory was 159.8MB in the beginning and 81.2MB in the end (delta: 78.6MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2022-01-10 21:41:56,717 INFO L158 Benchmark]: IcfgTransformer took 257.77ms. Allocated memory is still 210.8MB. Free memory was 81.2MB in the beginning and 141.9MB in the end (delta: -60.7MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2022-01-10 21:41:56,717 INFO L158 Benchmark]: TraceAbstraction took 12872.59ms. Allocated memory was 210.8MB in the beginning and 640.7MB in the end (delta: 429.9MB). Free memory was 141.4MB in the beginning and 359.9MB in the end (delta: -218.5MB). Peak memory consumption was 350.9MB. Max. memory is 8.0GB. [2022-01-10 21:41:56,718 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.08ms. Allocated memory is still 175.1MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 487.18ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 123.2MB in the beginning and 175.6MB in the end (delta: -52.4MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 119.28ms. Allocated memory is still 210.8MB. Free memory was 175.6MB in the beginning and 166.1MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.64ms. Allocated memory is still 210.8MB. Free memory was 166.1MB in the beginning and 159.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1081.80ms. Allocated memory is still 210.8MB. Free memory was 159.8MB in the beginning and 81.2MB in the end (delta: 78.6MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. * IcfgTransformer took 257.77ms. Allocated memory is still 210.8MB. Free memory was 81.2MB in the beginning and 141.9MB in the end (delta: -60.7MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12872.59ms. Allocated memory was 210.8MB in the beginning and 640.7MB in the end (delta: 429.9MB). Free memory was 141.4MB in the beginning and 359.9MB in the end (delta: -218.5MB). Peak memory consumption was 350.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1627]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int FloppyThread ; [L43] int KernelMode ; [L44] int Suspended ; [L45] int Executive ; [L46] int DiskController ; [L47] int FloppyDiskPeripheral ; [L48] int FlConfigCallBack ; [L49] int MaximumInterfaceType ; [L50] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L51] int myStatus ; [L52] int s ; [L53] int UNLOADED ; [L54] int NP ; [L55] int DC ; [L56] int SKIP1 ; [L57] int SKIP2 ; [L58] int MPR1 ; [L59] int MPR3 ; [L60] int IPC ; [L61] int pended ; [L62] int compRegistered ; [L63] int lowerDriverReturn ; [L64] int setEventCalled ; [L65] int customIrp ; [L88] int PagingReferenceCount = 0; [L89] int PagingMutex = 0; VAL [compRegistered=0, customIrp=0, DC=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=0, MPR3=0, myStatus=0, NP=0, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L668] int status ; [L669] int irp = __VERIFIER_nondet_int() ; [L670] int pirp ; [L671] int pirp__IoStatus__Status ; [L672] int irp_choice = __VERIFIER_nondet_int() ; [L673] int devobj = __VERIFIER_nondet_int() ; [L674] int __cil_tmp8 ; [L676] FloppyThread = 0 [L677] KernelMode = 0 [L678] Suspended = 0 [L679] Executive = 0 [L680] DiskController = 0 [L681] FloppyDiskPeripheral = 0 [L682] FlConfigCallBack = 0 [L683] MaximumInterfaceType = 0 [L684] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L685] myStatus = 0 [L686] s = 0 [L687] UNLOADED = 0 [L688] NP = 0 [L689] DC = 0 [L690] SKIP1 = 0 [L691] SKIP2 = 0 [L692] MPR1 = 0 [L693] MPR3 = 0 [L694] IPC = 0 [L695] pended = 0 [L696] compRegistered = 0 [L697] lowerDriverReturn = 0 [L698] setEventCalled = 0 [L699] customIrp = 0 [L703] status = 0 [L704] pirp = irp [L705] CALL _BLAST_init() [L71] UNLOADED = 0 [L72] NP = 1 [L73] DC = 2 [L74] SKIP1 = 3 [L75] SKIP2 = 4 [L76] MPR1 = 5 [L77] MPR3 = 6 [L78] IPC = 7 [L79] s = UNLOADED [L80] pended = 0 [L81] compRegistered = 0 [L82] lowerDriverReturn = 0 [L83] setEventCalled = 0 [L84] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L705] RET _BLAST_init() [L707] COND TRUE status >= 0 [L708] s = NP [L709] customIrp = 0 [L710] setEventCalled = customIrp [L711] lowerDriverReturn = setEventCalled [L712] compRegistered = lowerDriverReturn [L713] pended = compRegistered [L714] pirp__IoStatus__Status = 0 [L715] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, UNLOADED=0] [L716] COND TRUE irp_choice == 0 [L717] pirp__IoStatus__Status = -1073741637 [L718] myStatus = -1073741637 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, UNLOADED=0] [L721] CALL stub_driver_init() [L658] s = NP [L659] pended = 0 [L660] compRegistered = 0 [L661] lowerDriverReturn = 0 [L662] setEventCalled = 0 [L663] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L721] RET stub_driver_init() [L724] COND FALSE !(status < 0) [L728] int tmp_ndt_1; [L729] tmp_ndt_1 = __VERIFIER_nondet_int() [L730] COND FALSE !(tmp_ndt_1 == 0) [L733] int tmp_ndt_2; [L734] tmp_ndt_2 = __VERIFIER_nondet_int() [L735] COND FALSE !(tmp_ndt_2 == 1) [L738] int tmp_ndt_3; [L739] tmp_ndt_3 = __VERIFIER_nondet_int() [L740] COND FALSE !(tmp_ndt_3 == 2) [L743] int tmp_ndt_4; [L744] tmp_ndt_4 = __VERIFIER_nondet_int() [L745] COND TRUE tmp_ndt_4 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L767] CALL, EXPR FloppyPnp(devobj, pirp) [L161] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L162] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L163] int Irp__IoStatus__Information ; [L164] int Irp__IoStatus__Status ; [L165] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L166] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L167] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L168] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L169] int disketteExtension__HoldNewRequests ; [L170] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L171] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L172] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L173] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L174] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L175] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L176] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L177] int irpSp ; [L178] int disketteExtension ; [L179] int ntStatus ; [L180] int doneEvent = __VERIFIER_nondet_int() ; [L181] int irpSp___0 ; [L182] int nextIrpSp ; [L183] int nextIrpSp__Control ; [L184] int irpSp___1 ; [L185] int irpSp__Context ; [L186] int irpSp__Control ; [L187] long __cil_tmp29 ; [L188] long __cil_tmp30 ; [L191] ntStatus = 0 [L192] PagingReferenceCount ++ VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L193] COND TRUE PagingReferenceCount == 1 VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L196] disketteExtension = DeviceObject__DeviceExtension [L197] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L198] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__IsRemoved=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L207] COND FALSE !(irpSp__MinorFunction == 0) VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__IsRemoved=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L210] COND TRUE irpSp__MinorFunction == 5 VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__IsRemoved=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L236] COND TRUE irpSp__MinorFunction == 5 VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__IsRemoved=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L239] COND FALSE !(! disketteExtension__IsStarted) [L255] disketteExtension__HoldNewRequests = 1 [L256] CALL, EXPR FlQueueIrpToThread(Irp, disketteExtension) [L98] int status ; [L99] int threadHandle = __VERIFIER_nondet_int() ; [L100] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L101] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L103] int Irp__IoStatus__Status ; [L104] int Irp__IoStatus__Information ; [L105] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L106] int ObjAttributes = __VERIFIER_nondet_int() ; [L107] int __cil_tmp12 ; [L108] int __cil_tmp13 ; VAL [\old(DisketteExtension)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, DisketteExtension=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L111] COND FALSE !(DisketteExtension__PoweringDown == 1) [L117] DisketteExtension__ThreadReferenceCount ++ VAL [\old(DisketteExtension)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, DisketteExtension=0, DisketteExtension__PoweringDown=4, DisketteExtension__ThreadReferenceCount=1, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L118] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [\old(DisketteExtension)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, DisketteExtension=0, DisketteExtension__PoweringDown=4, DisketteExtension__ThreadReferenceCount=1, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L150] COND TRUE pended == 0 [L151] pended = 1 VAL [\old(DisketteExtension)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, DisketteExtension=0, DisketteExtension__PoweringDown=4, DisketteExtension__ThreadReferenceCount=1, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L157] return (259); VAL [\old(DisketteExtension)=0, \old(Irp)=0, \result=-253, compRegistered=0, customIrp=0, DC=2, DiskController=0, DisketteExtension=0, DisketteExtension__PoweringDown=4, DisketteExtension__ThreadReferenceCount=1, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L256] RET, EXPR FlQueueIrpToThread(Irp, disketteExtension) [L256] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L259] __cil_tmp29 = (long )ntStatus VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp29=259, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__HoldNewRequests=1, disketteExtension__IsRemoved=0, disketteExtension__IsStarted=1, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=259, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L260] COND TRUE __cil_tmp29 == 259L [L262-L263] CALL KeWaitForSingleObject(disketteExtension__FloppyThread, Executive, KernelMode, 0, 0) [L1066] COND FALSE !(s == MPR3) VAL [\old(Alertable)=0, \old(Object)=1, \old(Timeout)=0, \old(WaitMode)=0, \old(WaitReason)=0, Alertable=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, Object=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, Timeout=0, UNLOADED=0, WaitMode=0, WaitReason=0] [L1075] COND FALSE !(customIrp == 1) VAL [\old(Alertable)=0, \old(Object)=1, \old(Timeout)=0, \old(WaitMode)=0, \old(WaitReason)=0, Alertable=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, Object=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, Timeout=0, UNLOADED=0, WaitMode=0, WaitReason=0] [L1079] COND FALSE !(s == MPR3) VAL [\old(Alertable)=0, \old(Object)=1, \old(Timeout)=0, \old(WaitMode)=0, \old(WaitReason)=0, Alertable=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, Object=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, Timeout=0, UNLOADED=0, WaitMode=0, WaitReason=0] [L1086] int tmp_ndt_12; [L1087] tmp_ndt_12 = __VERIFIER_nondet_int() [L1088] COND TRUE tmp_ndt_12 == 0 VAL [\old(Alertable)=0, \old(Object)=1, \old(Timeout)=0, \old(WaitMode)=0, \old(WaitReason)=0, Alertable=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, Object=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, Timeout=0, tmp_ndt_12=0, UNLOADED=0, WaitMode=0, WaitReason=0] [L1094] return (0); VAL [\old(Alertable)=0, \old(Object)=1, \old(Timeout)=0, \old(WaitMode)=0, \old(WaitReason)=0, \result=0, Alertable=0, compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, Object=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, Timeout=0, tmp_ndt_12=0, UNLOADED=0, WaitMode=0, WaitReason=0] [L262-L263] RET KeWaitForSingleObject(disketteExtension__FloppyThread, Executive, KernelMode, 0, 0) [L265] COND TRUE disketteExtension__FloppyThread != 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp29=259, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__FloppyThread=1, disketteExtension__HoldNewRequests=1, disketteExtension__IsRemoved=0, disketteExtension__IsStarted=1, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, ntStatus=259, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L268] disketteExtension__FloppyThread = 0 [L269] Irp__IoStatus__Status = 0 [L270] myStatus = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp29=259, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__FloppyThread=0, disketteExtension__HoldNewRequests=1, disketteExtension__IsRemoved=0, disketteExtension__IsStarted=1, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__IoStatus__Status=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, ntStatus=259, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L271] COND TRUE s == NP [L272] s = SKIP1 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp29=259, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__FloppyThread=0, disketteExtension__HoldNewRequests=1, disketteExtension__IsRemoved=0, disketteExtension__IsStarted=1, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__IoStatus__Status=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, ntStatus=259, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L279] Irp__CurrentLocation ++ [L280] Irp__Tail__Overlay__CurrentStackLocation ++ [L281] CALL, EXPR IofCallDriver(disketteExtension__TargetObject, Irp) [L968] int returnVal2 ; [L969] int compRetStatus1 ; [L970] int lcontext = __VERIFIER_nondet_int() ; [L971] unsigned long __cil_tmp7 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L974] COND FALSE !(\read(compRegistered)) VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L987] int tmp_ndt_10; [L988] tmp_ndt_10 = __VERIFIER_nondet_int() [L989] COND TRUE tmp_ndt_10 == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, tmp_ndt_10=0, UNLOADED=0] [L1000] returnVal2 = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, returnVal2=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, tmp_ndt_10=0, UNLOADED=0] [L1013] COND FALSE !(s == NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, returnVal2=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, tmp_ndt_10=0, UNLOADED=0] [L1017] COND FALSE !(s == MPR1) VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, returnVal2=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, tmp_ndt_10=0, UNLOADED=0] [L1026] COND TRUE s == SKIP1 [L1027] s = SKIP2 [L1028] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, returnVal2=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, tmp_ndt_10=0, UNLOADED=0] [L1036] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, returnVal2=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, tmp_ndt_10=0, UNLOADED=0] [L281] RET, EXPR IofCallDriver(disketteExtension__TargetObject, Irp) [L281] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L427] PagingReferenceCount -- VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp29=259, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__FloppyThread=0, disketteExtension__HoldNewRequests=1, disketteExtension__IsRemoved=0, disketteExtension__IsStarted=1, disketteExtension__TargetObject=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__IoStatus__Status=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L428] COND TRUE PagingReferenceCount == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp29=259, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__FloppyThread=0, disketteExtension__HoldNewRequests=1, disketteExtension__IsRemoved=0, disketteExtension__IsStarted=1, disketteExtension__TargetObject=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__IoStatus__Status=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L431] return (ntStatus); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, __cil_tmp29=259, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DeviceObject__DeviceExtension=0, DiskController=0, disketteExtension=0, disketteExtension__FloppyThread=0, disketteExtension__HoldNewRequests=1, disketteExtension__IsRemoved=0, disketteExtension__IsStarted=1, disketteExtension__TargetObject=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__IoStatus__Status=0, Irp__Tail__Overlay__CurrentStackLocation=1, irpSp=0, irpSp__MinorFunction=5, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, ntStatus=0, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] RET, EXPR FloppyPnp(devobj, pirp) [L767] status = FloppyPnp(devobj, pirp) [L780] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, devobj=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L781] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, devobj=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L788] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, devobj=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L789] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, devobj=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L796] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, devobj=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L797] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, devobj=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L798] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, devobj=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L812] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, devobj=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=0, tmp_ndt_4=3, UNLOADED=0] [L813] COND TRUE status != 259 [L814] CALL errorFn() [L1627] reach_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - UnprovableResult [Line: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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, 642 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 59, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16725 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16725 mSDsluCounter, 90883 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58740 mSDsCounter, 643 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5421 IncrementalHoareTripleChecker+Invalid, 6064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 643 mSolverCounterUnsat, 32143 mSDtfsCounter, 5421 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=734occurred in iteration=4, InterpolantAutomatonStates: 272, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 58 MinimizatonAttempts, 3316 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2160 NumberOfCodeBlocks, 2160 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2042 ConstructedInterpolants, 0 QuantifiedInterpolants, 5014 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:56,731 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...