/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:36:00,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:36:00,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:36:00,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:36:00,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:36:00,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:36:00,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:36:00,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:36:00,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:36:00,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:36:00,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:36:00,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:36:00,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:36:00,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:36:00,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:36:00,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:36:00,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:36:01,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:36:01,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:36:01,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:36:01,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:36:01,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:36:01,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:36:01,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:36:01,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:36:01,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:36:01,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:36:01,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:36:01,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:36:01,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:36:01,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:36:01,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:36:01,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:36:01,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:36:01,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:36:01,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:36:01,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:36:01,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:36:01,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:36:01,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:36:01,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:36:01,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 02:36:01,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:36:01,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:36:01,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:36:01,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:36:01,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:36:01,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:36:01,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:36:01,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:36:01,034 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:36:01,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:36:01,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:36:01,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:36:01,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:36:01,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:36:01,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:36:01,035 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:36:01,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:36:01,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:36:01,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:36:01,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:36:01,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:36:01,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:36:01,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:36:01,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:36:01,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:36:01,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:36:01,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:36:01,036 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:36:01,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:36:01,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:36:01,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 02:36:01,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:36:01,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:36:01,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:36:01,246 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:36:01,247 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:36:01,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c [2022-01-10 02:36:01,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3f2109b/7c62b354c4d6455e942efb5f98f5f0ec/FLAG237038274 [2022-01-10 02:36:01,698 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:36:01,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c [2022-01-10 02:36:01,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3f2109b/7c62b354c4d6455e942efb5f98f5f0ec/FLAG237038274 [2022-01-10 02:36:01,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3f2109b/7c62b354c4d6455e942efb5f98f5f0ec [2022-01-10 02:36:01,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:36:01,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:36:01,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:36:01,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:36:01,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:36:01,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:01" (1/1) ... [2022-01-10 02:36:01,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9cee33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01, skipping insertion in model container [2022-01-10 02:36:01,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:01" (1/1) ... [2022-01-10 02:36:01,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:36:01,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:36:01,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c[911,924] [2022-01-10 02:36:02,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c[8416,8429] [2022-01-10 02:36:02,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:36:02,070 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:36:02,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c[911,924] [2022-01-10 02:36:02,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c[8416,8429] [2022-01-10 02:36:02,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:36:02,134 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:36:02,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02 WrapperNode [2022-01-10 02:36:02,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:36:02,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:36:02,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:36:02,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:36:02,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,206 INFO L137 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 672 [2022-01-10 02:36:02,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:36:02,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:36:02,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:36:02,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:36:02,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:36:02,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:36:02,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:36:02,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:36:02,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (1/1) ... [2022-01-10 02:36:02,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:36:02,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:36:02,299 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 02:36:02,304 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 02:36:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:36:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:36:02,325 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:36:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:36:02,325 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:36:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:36:02,325 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:36:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:36:02,325 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:36:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:36:02,325 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:36:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:36:02,326 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:36:02,326 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:36:02,326 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:36:02,326 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:36:02,326 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:36:02,326 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:36:02,326 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:36:02,326 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:36:02,326 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:36:02,326 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:36:02,326 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:36:02,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:36:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:36:02,327 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:36:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:36:02,327 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:36:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:36:02,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:36:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:36:02,327 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:36:02,431 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:36:02,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:36:02,851 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-01-10 02:36:02,852 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-01-10 02:36:02,891 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:36:02,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:36:02,899 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-01-10 02:36:02,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:02 BoogieIcfgContainer [2022-01-10 02:36:02,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:36:02,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:36:02,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:36:02,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:36:02,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:36:01" (1/3) ... [2022-01-10 02:36:02,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260ea03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:02, skipping insertion in model container [2022-01-10 02:36:02,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:02" (2/3) ... [2022-01-10 02:36:02,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260ea03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:02, skipping insertion in model container [2022-01-10 02:36:02,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:02" (3/3) ... [2022-01-10 02:36:02,914 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.05.cil-1.c [2022-01-10 02:36:02,917 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:36:02,917 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:36:02,948 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:36:02,952 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 02:36:02,952 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:36:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 272 states have (on average 1.5955882352941178) internal successors, (434), 278 states have internal predecessors, (434), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-01-10 02:36:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:02,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:02,976 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, 1, 1, 1, 1, 1] [2022-01-10 02:36:02,977 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1519130765, now seen corresponding path program 1 times [2022-01-10 02:36:02,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:02,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948202558] [2022-01-10 02:36:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:02,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:03,277 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 02:36:03,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:03,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948202558] [2022-01-10 02:36:03,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948202558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:03,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:03,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:36:03,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946484555] [2022-01-10 02:36:03,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:03,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:36:03,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:03,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:36:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:36:03,314 INFO L87 Difference]: Start difference. First operand has 324 states, 272 states have (on average 1.5955882352941178) internal successors, (434), 278 states have internal predecessors, (434), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:04,151 INFO L93 Difference]: Finished difference Result 778 states and 1209 transitions. [2022-01-10 02:36:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:04,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:36:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:04,167 INFO L225 Difference]: With dead ends: 778 [2022-01-10 02:36:04,167 INFO L226 Difference]: Without dead ends: 465 [2022-01-10 02:36:04,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:04,178 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 852 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:04,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 1715 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:36:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-01-10 02:36:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 426. [2022-01-10 02:36:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 360 states have internal predecessors, (525), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-01-10 02:36:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 624 transitions. [2022-01-10 02:36:04,271 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 624 transitions. Word has length 65 [2022-01-10 02:36:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:04,271 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 624 transitions. [2022-01-10 02:36:04,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 624 transitions. [2022-01-10 02:36:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:04,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:04,275 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, 1, 1, 1, 1, 1] [2022-01-10 02:36:04,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:36:04,276 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1237496501, now seen corresponding path program 1 times [2022-01-10 02:36:04,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:04,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665330031] [2022-01-10 02:36:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:04,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:04,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:04,439 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 02:36:04,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:04,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665330031] [2022-01-10 02:36:04,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665330031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:04,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:04,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:36:04,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544407198] [2022-01-10 02:36:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:04,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:36:04,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:04,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:36:04,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:36:04,442 INFO L87 Difference]: Start difference. First operand 426 states and 624 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:05,258 INFO L93 Difference]: Finished difference Result 823 states and 1190 transitions. [2022-01-10 02:36:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:36:05,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:36:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:05,261 INFO L225 Difference]: With dead ends: 823 [2022-01-10 02:36:05,262 INFO L226 Difference]: Without dead ends: 614 [2022-01-10 02:36:05,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:36:05,263 INFO L933 BasicCegarLoop]: 550 mSDtfsCounter, 1132 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:05,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1159 Valid, 1686 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:36:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-01-10 02:36:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 538. [2022-01-10 02:36:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 444 states have (on average 1.4662162162162162) internal successors, (651), 452 states have internal predecessors, (651), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-01-10 02:36:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 784 transitions. [2022-01-10 02:36:05,325 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 784 transitions. Word has length 65 [2022-01-10 02:36:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:05,325 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 784 transitions. [2022-01-10 02:36:05,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 784 transitions. [2022-01-10 02:36:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:05,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:05,327 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, 1, 1, 1, 1, 1] [2022-01-10 02:36:05,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:36:05,327 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:05,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1028884685, now seen corresponding path program 1 times [2022-01-10 02:36:05,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:05,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386299291] [2022-01-10 02:36:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:05,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:05,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:05,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:05,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:05,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:36:05,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:05,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386299291] [2022-01-10 02:36:05,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386299291] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:05,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:05,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 02:36:05,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027374914] [2022-01-10 02:36:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:05,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:36:05,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:36:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:36:05,446 INFO L87 Difference]: Start difference. First operand 538 states and 784 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 02:36:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:06,858 INFO L93 Difference]: Finished difference Result 2084 states and 2982 transitions. [2022-01-10 02:36:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:36:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-01-10 02:36:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:06,865 INFO L225 Difference]: With dead ends: 2084 [2022-01-10 02:36:06,865 INFO L226 Difference]: Without dead ends: 1751 [2022-01-10 02:36:06,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 02:36:06,867 INFO L933 BasicCegarLoop]: 600 mSDtfsCounter, 2637 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2655 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:06,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2655 Valid, 2294 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:36:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2022-01-10 02:36:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1591. [2022-01-10 02:36:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1292 states have (on average 1.3893188854489165) internal successors, (1795), 1315 states have internal predecessors, (1795), 171 states have call successors, (171), 111 states have call predecessors, (171), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-01-10 02:36:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2171 transitions. [2022-01-10 02:36:06,924 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2171 transitions. Word has length 65 [2022-01-10 02:36:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:06,924 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2171 transitions. [2022-01-10 02:36:06,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 02:36:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2171 transitions. [2022-01-10 02:36:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:36:06,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:06,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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:36:06,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:36:06,926 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash -591028054, now seen corresponding path program 1 times [2022-01-10 02:36:06,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:06,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856866921] [2022-01-10 02:36:06,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:06,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:06,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:06,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 02:36:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 02:36:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,036 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 02:36:07,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:07,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856866921] [2022-01-10 02:36:07,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856866921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:07,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:07,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:36:07,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181272140] [2022-01-10 02:36:07,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:07,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:36:07,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:07,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:36:07,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:36:07,038 INFO L87 Difference]: Start difference. First operand 1591 states and 2171 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:36:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:07,696 INFO L93 Difference]: Finished difference Result 3119 states and 4250 transitions. [2022-01-10 02:36:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:36:07,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-10 02:36:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:07,704 INFO L225 Difference]: With dead ends: 3119 [2022-01-10 02:36:07,704 INFO L226 Difference]: Without dead ends: 1739 [2022-01-10 02:36:07,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:07,707 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 386 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:07,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 2038 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:36:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-01-10 02:36:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1631. [2022-01-10 02:36:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1324 states have (on average 1.3753776435045317) internal successors, (1821), 1347 states have internal predecessors, (1821), 171 states have call successors, (171), 111 states have call predecessors, (171), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-01-10 02:36:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2205 transitions. [2022-01-10 02:36:07,760 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2205 transitions. Word has length 66 [2022-01-10 02:36:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:07,761 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2205 transitions. [2022-01-10 02:36:07,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:36:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2205 transitions. [2022-01-10 02:36:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:36:07,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:07,762 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, 1, 1, 1, 1, 1, 1] [2022-01-10 02:36:07,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:36:07,762 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1620387352, now seen corresponding path program 1 times [2022-01-10 02:36:07,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:07,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996258041] [2022-01-10 02:36:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:07,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 02:36:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 02:36:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:07,844 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 02:36:07,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:07,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996258041] [2022-01-10 02:36:07,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996258041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:07,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:07,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 02:36:07,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626707692] [2022-01-10 02:36:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:07,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:36:07,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:07,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:36:07,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:36:07,846 INFO L87 Difference]: Start difference. First operand 1631 states and 2205 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:36:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:09,345 INFO L93 Difference]: Finished difference Result 5203 states and 7079 transitions. [2022-01-10 02:36:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:36:09,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-01-10 02:36:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:09,355 INFO L225 Difference]: With dead ends: 5203 [2022-01-10 02:36:09,355 INFO L226 Difference]: Without dead ends: 2022 [2022-01-10 02:36:09,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 02:36:09,364 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 3068 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3086 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:09,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3086 Valid, 2023 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:36:09,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2022-01-10 02:36:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1842. [2022-01-10 02:36:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1463 states have (on average 1.330827067669173) internal successors, (1947), 1488 states have internal predecessors, (1947), 211 states have call successors, (211), 139 states have call predecessors, (211), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-01-10 02:36:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2417 transitions. [2022-01-10 02:36:09,446 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2417 transitions. Word has length 66 [2022-01-10 02:36:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:09,447 INFO L470 AbstractCegarLoop]: Abstraction has 1842 states and 2417 transitions. [2022-01-10 02:36:09,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:36:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2417 transitions. [2022-01-10 02:36:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 02:36:09,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:09,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:09,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:36:09,449 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:09,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash -920662268, now seen corresponding path program 1 times [2022-01-10 02:36:09,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:09,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563625089] [2022-01-10 02:36:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:09,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:36:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:36:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:36:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:36:09,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:09,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563625089] [2022-01-10 02:36:09,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563625089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:09,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:09,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:36:09,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054067503] [2022-01-10 02:36:09,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:09,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:36:09,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:09,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:36:09,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:36:09,562 INFO L87 Difference]: Start difference. First operand 1842 states and 2417 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:36:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:10,325 INFO L93 Difference]: Finished difference Result 3667 states and 4819 transitions. [2022-01-10 02:36:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:36:10,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-01-10 02:36:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:10,334 INFO L225 Difference]: With dead ends: 3667 [2022-01-10 02:36:10,335 INFO L226 Difference]: Without dead ends: 2036 [2022-01-10 02:36:10,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:10,340 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 560 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:10,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1786 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:36:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-01-10 02:36:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1902. [2022-01-10 02:36:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1511 states have (on average 1.3163467902051622) internal successors, (1989), 1536 states have internal predecessors, (1989), 211 states have call successors, (211), 139 states have call predecessors, (211), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-01-10 02:36:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2471 transitions. [2022-01-10 02:36:10,416 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2471 transitions. Word has length 91 [2022-01-10 02:36:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:10,417 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 2471 transitions. [2022-01-10 02:36:10,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:36:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2471 transitions. [2022-01-10 02:36:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 02:36:10,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:10,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:10,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:36:10,419 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:10,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash -476761594, now seen corresponding path program 1 times [2022-01-10 02:36:10,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:10,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817421006] [2022-01-10 02:36:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:10,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:36:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:36:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:36:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:36:10,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:10,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817421006] [2022-01-10 02:36:10,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817421006] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:10,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:10,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:36:10,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959155009] [2022-01-10 02:36:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:10,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:36:10,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:10,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:36:10,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:36:10,535 INFO L87 Difference]: Start difference. First operand 1902 states and 2471 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:11,280 INFO L93 Difference]: Finished difference Result 3429 states and 4435 transitions. [2022-01-10 02:36:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 02:36:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-01-10 02:36:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:11,286 INFO L225 Difference]: With dead ends: 3429 [2022-01-10 02:36:11,287 INFO L226 Difference]: Without dead ends: 1976 [2022-01-10 02:36:11,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-01-10 02:36:11,290 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 915 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:11,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [939 Valid, 1638 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:36:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2022-01-10 02:36:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1681. [2022-01-10 02:36:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1343 states have (on average 1.3186895011169024) internal successors, (1771), 1363 states have internal predecessors, (1771), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-01-10 02:36:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2185 transitions. [2022-01-10 02:36:11,340 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2185 transitions. Word has length 91 [2022-01-10 02:36:11,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:11,340 INFO L470 AbstractCegarLoop]: Abstraction has 1681 states and 2185 transitions. [2022-01-10 02:36:11,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2185 transitions. [2022-01-10 02:36:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 02:36:11,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:11,342 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:11,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:36:11,342 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:11,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1462400452, now seen corresponding path program 1 times [2022-01-10 02:36:11,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:11,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349410704] [2022-01-10 02:36:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:11,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:36:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:36:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:36:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 02:36:11,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:11,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349410704] [2022-01-10 02:36:11,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349410704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:11,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:11,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:11,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151315217] [2022-01-10 02:36:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:11,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:11,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:11,424 INFO L87 Difference]: Start difference. First operand 1681 states and 2185 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:36:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:11,835 INFO L93 Difference]: Finished difference Result 4833 states and 6297 transitions. [2022-01-10 02:36:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:36:11,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-01-10 02:36:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:11,849 INFO L225 Difference]: With dead ends: 4833 [2022-01-10 02:36:11,849 INFO L226 Difference]: Without dead ends: 3364 [2022-01-10 02:36:11,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:36:11,854 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 832 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:11,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 1446 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:36:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2022-01-10 02:36:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 3150. [2022-01-10 02:36:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 2492 states have (on average 1.2837078651685394) internal successors, (3199), 2541 states have internal predecessors, (3199), 344 states have call successors, (344), 233 states have call predecessors, (344), 312 states have return successors, (514), 378 states have call predecessors, (514), 342 states have call successors, (514) [2022-01-10 02:36:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4057 transitions. [2022-01-10 02:36:11,967 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4057 transitions. Word has length 91 [2022-01-10 02:36:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:11,967 INFO L470 AbstractCegarLoop]: Abstraction has 3150 states and 4057 transitions. [2022-01-10 02:36:11,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:36:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4057 transitions. [2022-01-10 02:36:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 02:36:11,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:11,969 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:11,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:36:11,969 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 404562374, now seen corresponding path program 1 times [2022-01-10 02:36:11,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:11,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516353378] [2022-01-10 02:36:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:11,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:36:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:36:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:36:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:36:12,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:12,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516353378] [2022-01-10 02:36:12,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516353378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:12,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:12,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:36:12,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49711275] [2022-01-10 02:36:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:12,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:36:12,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:12,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:36:12,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:36:12,024 INFO L87 Difference]: Start difference. First operand 3150 states and 4057 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:12,351 INFO L93 Difference]: Finished difference Result 4734 states and 6041 transitions. [2022-01-10 02:36:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:36:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-01-10 02:36:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:12,361 INFO L225 Difference]: With dead ends: 4734 [2022-01-10 02:36:12,362 INFO L226 Difference]: Without dead ends: 1796 [2022-01-10 02:36:12,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:36:12,369 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 674 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:12,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [689 Valid, 992 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:36:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2022-01-10 02:36:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1681. [2022-01-10 02:36:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1343 states have (on average 1.2911392405063291) internal successors, (1734), 1363 states have internal predecessors, (1734), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-01-10 02:36:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2148 transitions. [2022-01-10 02:36:12,441 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2148 transitions. Word has length 91 [2022-01-10 02:36:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:12,442 INFO L470 AbstractCegarLoop]: Abstraction has 1681 states and 2148 transitions. [2022-01-10 02:36:12,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2148 transitions. [2022-01-10 02:36:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 02:36:12,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:12,443 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:12,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:36:12,443 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:12,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1171182892, now seen corresponding path program 1 times [2022-01-10 02:36:12,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:12,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353220815] [2022-01-10 02:36:12,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:12,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:36:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:36:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 02:36:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 02:36:12,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:12,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353220815] [2022-01-10 02:36:12,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353220815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:12,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:12,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:36:12,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101796939] [2022-01-10 02:36:12,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:12,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:36:12,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:36:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:36:12,520 INFO L87 Difference]: Start difference. First operand 1681 states and 2148 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:36:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:13,544 INFO L93 Difference]: Finished difference Result 4099 states and 5231 transitions. [2022-01-10 02:36:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 02:36:13,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-01-10 02:36:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:13,553 INFO L225 Difference]: With dead ends: 4099 [2022-01-10 02:36:13,553 INFO L226 Difference]: Without dead ends: 2479 [2022-01-10 02:36:13,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-01-10 02:36:13,573 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 1777 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:13,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1812 Valid, 1793 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:36:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2022-01-10 02:36:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2302. [2022-01-10 02:36:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 1810 states have (on average 1.2574585635359117) internal successors, (2276), 1838 states have internal predecessors, (2276), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-01-10 02:36:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2898 transitions. [2022-01-10 02:36:13,657 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2898 transitions. Word has length 92 [2022-01-10 02:36:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:13,659 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 2898 transitions. [2022-01-10 02:36:13,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:36:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2898 transitions. [2022-01-10 02:36:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:13,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:13,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:13,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:36:13,662 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash 972429717, now seen corresponding path program 1 times [2022-01-10 02:36:13,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:13,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047860844] [2022-01-10 02:36:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:13,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:13,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:13,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:13,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:13,720 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 02:36:13,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:13,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047860844] [2022-01-10 02:36:13,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047860844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:13,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:13,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:36:13,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682055708] [2022-01-10 02:36:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:13,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:36:13,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:13,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:36:13,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:36:13,722 INFO L87 Difference]: Start difference. First operand 2302 states and 2898 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:14,320 INFO L93 Difference]: Finished difference Result 2562 states and 3308 transitions. [2022-01-10 02:36:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:36:14,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:14,330 INFO L225 Difference]: With dead ends: 2562 [2022-01-10 02:36:14,330 INFO L226 Difference]: Without dead ends: 2367 [2022-01-10 02:36:14,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:36:14,338 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 614 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:14,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 878 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:36:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2022-01-10 02:36:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2302. [2022-01-10 02:36:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 1810 states have (on average 1.2569060773480663) internal successors, (2275), 1838 states have internal predecessors, (2275), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-01-10 02:36:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2897 transitions. [2022-01-10 02:36:14,439 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2897 transitions. Word has length 101 [2022-01-10 02:36:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:14,439 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 2897 transitions. [2022-01-10 02:36:14,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2897 transitions. [2022-01-10 02:36:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:14,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:14,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:14,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 02:36:14,442 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:14,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1000930007, now seen corresponding path program 1 times [2022-01-10 02:36:14,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:14,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844612201] [2022-01-10 02:36:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:14,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:14,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:14,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:14,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:14,512 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 02:36:14,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:14,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844612201] [2022-01-10 02:36:14,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844612201] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:14,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:14,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:36:14,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366492591] [2022-01-10 02:36:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:14,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:36:14,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:14,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:36:14,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:36:14,513 INFO L87 Difference]: Start difference. First operand 2302 states and 2897 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:15,562 INFO L93 Difference]: Finished difference Result 2814 states and 3704 transitions. [2022-01-10 02:36:15,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:36:15,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:15,570 INFO L225 Difference]: With dead ends: 2814 [2022-01-10 02:36:15,570 INFO L226 Difference]: Without dead ends: 2625 [2022-01-10 02:36:15,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:36:15,571 INFO L933 BasicCegarLoop]: 487 mSDtfsCounter, 989 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:15,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1013 Valid, 1170 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:36:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2022-01-10 02:36:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2496. [2022-01-10 02:36:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 1983 states have (on average 1.2829046898638428) internal successors, (2544), 2012 states have internal predecessors, (2544), 274 states have call successors, (274), 174 states have call predecessors, (274), 237 states have return successors, (379), 311 states have call predecessors, (379), 272 states have call successors, (379) [2022-01-10 02:36:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3197 transitions. [2022-01-10 02:36:15,664 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3197 transitions. Word has length 101 [2022-01-10 02:36:15,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:15,664 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 3197 transitions. [2022-01-10 02:36:15,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3197 transitions. [2022-01-10 02:36:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:15,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:15,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:15,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:36:15,665 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash -715954597, now seen corresponding path program 1 times [2022-01-10 02:36:15,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:15,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967936038] [2022-01-10 02:36:15,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:15,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:15,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:15,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:15,730 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 02:36:15,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:15,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967936038] [2022-01-10 02:36:15,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967936038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:15,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:15,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:15,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854244777] [2022-01-10 02:36:15,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:15,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:15,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:15,743 INFO L87 Difference]: Start difference. First operand 2496 states and 3197 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:17,119 INFO L93 Difference]: Finished difference Result 3274 states and 4421 transitions. [2022-01-10 02:36:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:17,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:17,137 INFO L225 Difference]: With dead ends: 3274 [2022-01-10 02:36:17,137 INFO L226 Difference]: Without dead ends: 2891 [2022-01-10 02:36:17,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:17,141 INFO L933 BasicCegarLoop]: 630 mSDtfsCounter, 994 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:17,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1018 Valid, 1846 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:36:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-01-10 02:36:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2678. [2022-01-10 02:36:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2678 states, 2144 states have (on average 1.3008395522388059) internal successors, (2789), 2174 states have internal predecessors, (2789), 288 states have call successors, (288), 180 states have call predecessors, (288), 244 states have return successors, (395), 326 states have call predecessors, (395), 286 states have call successors, (395) [2022-01-10 02:36:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 3472 transitions. [2022-01-10 02:36:17,276 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 3472 transitions. Word has length 101 [2022-01-10 02:36:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:17,277 INFO L470 AbstractCegarLoop]: Abstraction has 2678 states and 3472 transitions. [2022-01-10 02:36:17,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 3472 transitions. [2022-01-10 02:36:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:17,278 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:17,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:17,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:36:17,278 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:17,279 INFO L85 PathProgramCache]: Analyzing trace with hash 608901597, now seen corresponding path program 1 times [2022-01-10 02:36:17,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:17,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704673327] [2022-01-10 02:36:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:17,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:17,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:17,360 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 02:36:17,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:17,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704673327] [2022-01-10 02:36:17,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704673327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:17,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:17,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:17,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960861392] [2022-01-10 02:36:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:17,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:17,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:17,362 INFO L87 Difference]: Start difference. First operand 2678 states and 3472 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:18,672 INFO L93 Difference]: Finished difference Result 3949 states and 5464 transitions. [2022-01-10 02:36:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:18,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:18,703 INFO L225 Difference]: With dead ends: 3949 [2022-01-10 02:36:18,703 INFO L226 Difference]: Without dead ends: 3384 [2022-01-10 02:36:18,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:18,708 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 990 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:18,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1014 Valid, 1839 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:36:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2022-01-10 02:36:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3045. [2022-01-10 02:36:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 2469 states have (on average 1.3300931551235318) internal successors, (3284), 2501 states have internal predecessors, (3284), 316 states have call successors, (316), 192 states have call predecessors, (316), 258 states have return successors, (431), 356 states have call predecessors, (431), 314 states have call successors, (431) [2022-01-10 02:36:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 4031 transitions. [2022-01-10 02:36:18,828 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 4031 transitions. Word has length 101 [2022-01-10 02:36:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:18,829 INFO L470 AbstractCegarLoop]: Abstraction has 3045 states and 4031 transitions. [2022-01-10 02:36:18,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 4031 transitions. [2022-01-10 02:36:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:18,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:18,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:18,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:36:18,830 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2119307749, now seen corresponding path program 1 times [2022-01-10 02:36:18,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:18,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297473412] [2022-01-10 02:36:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:18,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:18,896 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 02:36:18,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:18,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297473412] [2022-01-10 02:36:18,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297473412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:18,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:18,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:18,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015313286] [2022-01-10 02:36:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:18,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:18,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:18,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:18,898 INFO L87 Difference]: Start difference. First operand 3045 states and 4031 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:20,273 INFO L93 Difference]: Finished difference Result 5258 states and 7483 transitions. [2022-01-10 02:36:20,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:20,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:20,286 INFO L225 Difference]: With dead ends: 5258 [2022-01-10 02:36:20,286 INFO L226 Difference]: Without dead ends: 4326 [2022-01-10 02:36:20,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:20,291 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 989 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:20,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1013 Valid, 1834 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:36:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2022-01-10 02:36:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 3782. [2022-01-10 02:36:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3122 states have (on average 1.3702754644458681) internal successors, (4278), 3158 states have internal predecessors, (4278), 372 states have call successors, (372), 216 states have call predecessors, (372), 286 states have return successors, (509), 416 states have call predecessors, (509), 370 states have call successors, (509) [2022-01-10 02:36:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5159 transitions. [2022-01-10 02:36:20,447 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5159 transitions. Word has length 101 [2022-01-10 02:36:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:20,448 INFO L470 AbstractCegarLoop]: Abstraction has 3782 states and 5159 transitions. [2022-01-10 02:36:20,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5159 transitions. [2022-01-10 02:36:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:20,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:20,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:20,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 02:36:20,450 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1117821469, now seen corresponding path program 1 times [2022-01-10 02:36:20,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:20,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968917330] [2022-01-10 02:36:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:20,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:20,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:20,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:20,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:36:20,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:20,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968917330] [2022-01-10 02:36:20,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968917330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:20,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:20,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:20,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283586577] [2022-01-10 02:36:20,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:20,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:20,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:20,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:20,542 INFO L87 Difference]: Start difference. First operand 3782 states and 5159 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:21,964 INFO L93 Difference]: Finished difference Result 7877 states and 11541 transitions. [2022-01-10 02:36:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:21,983 INFO L225 Difference]: With dead ends: 7877 [2022-01-10 02:36:21,983 INFO L226 Difference]: Without dead ends: 6208 [2022-01-10 02:36:21,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:21,990 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 988 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:21,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1012 Valid, 1829 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:36:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6208 states. [2022-01-10 02:36:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6208 to 5263. [2022-01-10 02:36:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 4435 states have (on average 1.4151071025930102) internal successors, (6276), 4479 states have internal predecessors, (6276), 484 states have call successors, (484), 264 states have call predecessors, (484), 342 states have return successors, (683), 536 states have call predecessors, (683), 482 states have call successors, (683) [2022-01-10 02:36:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 7443 transitions. [2022-01-10 02:36:22,239 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 7443 transitions. Word has length 101 [2022-01-10 02:36:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:22,239 INFO L470 AbstractCegarLoop]: Abstraction has 5263 states and 7443 transitions. [2022-01-10 02:36:22,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 7443 transitions. [2022-01-10 02:36:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:22,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:22,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:22,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:36:22,243 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash -24680997, now seen corresponding path program 1 times [2022-01-10 02:36:22,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:22,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783571059] [2022-01-10 02:36:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:22,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:22,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:22,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:22,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 02:36:22,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:22,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783571059] [2022-01-10 02:36:22,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783571059] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:22,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:22,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:22,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713707224] [2022-01-10 02:36:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:22,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:22,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:22,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:22,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:22,314 INFO L87 Difference]: Start difference. First operand 5263 states and 7443 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:24,113 INFO L93 Difference]: Finished difference Result 14380 states and 21609 transitions. [2022-01-10 02:36:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:36:24,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:24,156 INFO L225 Difference]: With dead ends: 14380 [2022-01-10 02:36:24,156 INFO L226 Difference]: Without dead ends: 11230 [2022-01-10 02:36:24,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:24,217 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1083 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:24,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1106 Valid, 1454 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:36:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11230 states. [2022-01-10 02:36:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11230 to 8192. [2022-01-10 02:36:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8192 states, 7044 states have (on average 1.4568427030096536) internal successors, (10262), 7104 states have internal predecessors, (10262), 692 states have call successors, (692), 360 states have call predecessors, (692), 454 states have return successors, (1069), 760 states have call predecessors, (1069), 690 states have call successors, (1069) [2022-01-10 02:36:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 12023 transitions. [2022-01-10 02:36:24,617 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 12023 transitions. Word has length 101 [2022-01-10 02:36:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:24,617 INFO L470 AbstractCegarLoop]: Abstraction has 8192 states and 12023 transitions. [2022-01-10 02:36:24,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 12023 transitions. [2022-01-10 02:36:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:24,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:24,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:24,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:36:24,623 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash 215558749, now seen corresponding path program 1 times [2022-01-10 02:36:24,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:24,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599191196] [2022-01-10 02:36:24,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:24,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:24,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:24,694 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 02:36:24,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:24,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599191196] [2022-01-10 02:36:24,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599191196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:24,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:24,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:24,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596859225] [2022-01-10 02:36:24,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:24,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:24,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:24,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:24,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:24,696 INFO L87 Difference]: Start difference. First operand 8192 states and 12023 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:26,882 INFO L93 Difference]: Finished difference Result 25595 states and 39247 transitions. [2022-01-10 02:36:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:36:26,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:26,940 INFO L225 Difference]: With dead ends: 25595 [2022-01-10 02:36:26,940 INFO L226 Difference]: Without dead ends: 19516 [2022-01-10 02:36:26,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:26,965 INFO L933 BasicCegarLoop]: 600 mSDtfsCounter, 1159 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:26,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 1805 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:36:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19516 states. [2022-01-10 02:36:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19516 to 13873. [2022-01-10 02:36:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13873 states, 12101 states have (on average 1.4868192711346169) internal successors, (17992), 12193 states have internal predecessors, (17992), 1092 states have call successors, (1092), 552 states have call predecessors, (1092), 678 states have return successors, (1987), 1192 states have call predecessors, (1987), 1090 states have call successors, (1987) [2022-01-10 02:36:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13873 states to 13873 states and 21071 transitions. [2022-01-10 02:36:27,733 INFO L78 Accepts]: Start accepts. Automaton has 13873 states and 21071 transitions. Word has length 101 [2022-01-10 02:36:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:27,733 INFO L470 AbstractCegarLoop]: Abstraction has 13873 states and 21071 transitions. [2022-01-10 02:36:27,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 13873 states and 21071 transitions. [2022-01-10 02:36:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:27,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:27,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:27,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 02:36:27,744 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1054592411, now seen corresponding path program 1 times [2022-01-10 02:36:27,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:27,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646096162] [2022-01-10 02:36:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:27,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,801 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 02:36:27,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:27,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646096162] [2022-01-10 02:36:27,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646096162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:27,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:27,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:27,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440731855] [2022-01-10 02:36:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:27,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:27,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:27,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:27,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:27,802 INFO L87 Difference]: Start difference. First operand 13873 states and 21071 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:31,232 INFO L93 Difference]: Finished difference Result 46954 states and 73429 transitions. [2022-01-10 02:36:31,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:36:31,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:31,362 INFO L225 Difference]: With dead ends: 46954 [2022-01-10 02:36:31,362 INFO L226 Difference]: Without dead ends: 35194 [2022-01-10 02:36:31,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:31,405 INFO L933 BasicCegarLoop]: 654 mSDtfsCounter, 1021 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:31,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1044 Valid, 1862 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:36:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35194 states. [2022-01-10 02:36:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35194 to 25362. [2022-01-10 02:36:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25362 states, 22374 states have (on average 1.5079109680879592) internal successors, (33738), 22530 states have internal predecessors, (33738), 1860 states have call successors, (1860), 936 states have call predecessors, (1860), 1126 states have return successors, (4277), 2024 states have call predecessors, (4277), 1858 states have call successors, (4277) [2022-01-10 02:36:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25362 states to 25362 states and 39875 transitions. [2022-01-10 02:36:33,035 INFO L78 Accepts]: Start accepts. Automaton has 25362 states and 39875 transitions. Word has length 101 [2022-01-10 02:36:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:33,035 INFO L470 AbstractCegarLoop]: Abstraction has 25362 states and 39875 transitions. [2022-01-10 02:36:33,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 25362 states and 39875 transitions. [2022-01-10 02:36:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:33,051 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:33,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:33,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:36:33,051 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1081658013, now seen corresponding path program 1 times [2022-01-10 02:36:33,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:33,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993063977] [2022-01-10 02:36:33,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:33,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:33,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:33,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:33,141 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 02:36:33,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:33,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993063977] [2022-01-10 02:36:33,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993063977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:33,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:33,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:33,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077164869] [2022-01-10 02:36:33,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:33,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:33,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:33,143 INFO L87 Difference]: Start difference. First operand 25362 states and 39875 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:37,950 INFO L93 Difference]: Finished difference Result 86983 states and 139735 transitions. [2022-01-10 02:36:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:36:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:38,171 INFO L225 Difference]: With dead ends: 86983 [2022-01-10 02:36:38,171 INFO L226 Difference]: Without dead ends: 63734 [2022-01-10 02:36:38,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:38,239 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1040 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:38,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1070 Valid, 1793 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:36:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63734 states. [2022-01-10 02:36:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63734 to 48404. [2022-01-10 02:36:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48404 states, 43048 states have (on average 1.5227188254971196) internal successors, (65550), 43332 states have internal predecessors, (65550), 3332 states have call successors, (3332), 1704 states have call predecessors, (3332), 2022 states have return successors, (10251), 3624 states have call predecessors, (10251), 3330 states have call successors, (10251) [2022-01-10 02:36:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48404 states to 48404 states and 79133 transitions. [2022-01-10 02:36:41,450 INFO L78 Accepts]: Start accepts. Automaton has 48404 states and 79133 transitions. Word has length 101 [2022-01-10 02:36:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:41,451 INFO L470 AbstractCegarLoop]: Abstraction has 48404 states and 79133 transitions. [2022-01-10 02:36:41,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48404 states and 79133 transitions. [2022-01-10 02:36:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:41,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:41,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:41,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 02:36:41,478 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1479204833, now seen corresponding path program 1 times [2022-01-10 02:36:41,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:41,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124751705] [2022-01-10 02:36:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:41,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,539 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 02:36:41,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:41,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124751705] [2022-01-10 02:36:41,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124751705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:41,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:41,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:41,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830633224] [2022-01-10 02:36:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:41,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:41,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:41,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:41,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:41,541 INFO L87 Difference]: Start difference. First operand 48404 states and 79133 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:49,600 INFO L93 Difference]: Finished difference Result 166727 states and 277487 transitions. [2022-01-10 02:36:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:36:49,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-01-10 02:36:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:50,245 INFO L225 Difference]: With dead ends: 166727 [2022-01-10 02:36:50,245 INFO L226 Difference]: Without dead ends: 120436 [2022-01-10 02:36:50,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:50,351 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 985 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:50,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1008 Valid, 1801 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:36:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120436 states. [2022-01-10 02:36:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120436 to 94357. [2022-01-10 02:36:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94357 states, 84393 states have (on average 1.5320701953953526) internal successors, (129296), 84933 states have internal predecessors, (129296), 6148 states have call successors, (6148), 3240 states have call predecessors, (6148), 3814 states have return successors, (26445), 6696 states have call predecessors, (26445), 6146 states have call successors, (26445) [2022-01-10 02:36:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94357 states to 94357 states and 161889 transitions. [2022-01-10 02:36:56,300 INFO L78 Accepts]: Start accepts. Automaton has 94357 states and 161889 transitions. Word has length 101 [2022-01-10 02:36:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:56,301 INFO L470 AbstractCegarLoop]: Abstraction has 94357 states and 161889 transitions. [2022-01-10 02:36:56,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:36:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 94357 states and 161889 transitions. [2022-01-10 02:36:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:36:56,359 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:56,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:56,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 02:36:56,359 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -591981987, now seen corresponding path program 1 times [2022-01-10 02:36:56,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582751439] [2022-01-10 02:36:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:56,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 02:36:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-10 02:36:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 02:36:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 02:36:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,441 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 02:36:56,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:56,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582751439] [2022-01-10 02:36:56,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582751439] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:56,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:56,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:56,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678235199] [2022-01-10 02:36:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:56,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:56,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:56,443 INFO L87 Difference]: Start difference. First operand 94357 states and 161889 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)