/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.08.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:36:22,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:36:22,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:36:22,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:36:22,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:36:22,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:36:22,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:36:22,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:36:22,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:36:22,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:36:22,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:36:22,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:36:22,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:36:22,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:36:22,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:36:22,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:36:22,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:36:22,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:36:22,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:36:22,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:36:22,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:36:22,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:36:22,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:36:22,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:36:22,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:36:22,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:36:22,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:36:22,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:36:22,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:36:22,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:36:22,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:36:22,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:36:22,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:36:22,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:36:22,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:36:22,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:36:22,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:36:22,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:36:22,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:36:22,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:36:22,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:36:22,657 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:22,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:36:22,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:36:22,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:36:22,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:36:22,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:36:22,684 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:36:22,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:36:22,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:36:22,685 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:36:22,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:36:22,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:36:22,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:36:22,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:36:22,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:36:22,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:36:22,685 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:36:22,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:36:22,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:36:22,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:36:22,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:36:22,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:36:22,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:36:22,687 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:22,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:36:22,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:36:22,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:36:22,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:36:22,906 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:36:22,908 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.08.cil-1.c [2022-01-10 02:36:22,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e179b9f6/9464129c56c747f19cda46a0e5ef7052/FLAG3f5566cf0 [2022-01-10 02:36:23,329 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:36:23,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.08.cil-1.c [2022-01-10 02:36:23,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e179b9f6/9464129c56c747f19cda46a0e5ef7052/FLAG3f5566cf0 [2022-01-10 02:36:23,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e179b9f6/9464129c56c747f19cda46a0e5ef7052 [2022-01-10 02:36:23,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:36:23,699 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:36:23,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:36:23,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:36:23,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:36:23,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:23" (1/1) ... [2022-01-10 02:36:23,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c10bde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:23, skipping insertion in model container [2022-01-10 02:36:23,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:23" (1/1) ... [2022-01-10 02:36:23,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:36:23,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:36:23,950 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.08.cil-1.c[911,924] [2022-01-10 02:36:24,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.08.cil-1.c[8416,8429] [2022-01-10 02:36:24,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:36:24,094 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:36:24,109 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.08.cil-1.c[911,924] [2022-01-10 02:36:24,126 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.08.cil-1.c[8416,8429] [2022-01-10 02:36:24,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:36:24,185 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:36:24,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:24 WrapperNode [2022-01-10 02:36:24,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:36:24,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:36:24,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:36:24,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:36:24,191 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:24" (1/1) ... [2022-01-10 02:36:24,210 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:24" (1/1) ... [2022-01-10 02:36:24,251 INFO L137 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 846 [2022-01-10 02:36:24,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:36:24,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:36:24,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:36:24,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:36:24,266 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:24" (1/1) ... [2022-01-10 02:36:24,266 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:24" (1/1) ... [2022-01-10 02:36:24,270 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:24" (1/1) ... [2022-01-10 02:36:24,271 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:24" (1/1) ... [2022-01-10 02:36:24,295 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:24" (1/1) ... [2022-01-10 02:36:24,307 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:24" (1/1) ... [2022-01-10 02:36:24,309 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:24" (1/1) ... [2022-01-10 02:36:24,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:36:24,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:36:24,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:36:24,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:36:24,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:24" (1/1) ... [2022-01-10 02:36:24,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:36:24,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:36:24,360 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:24,398 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:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:36:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:36:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:36:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:36:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:36:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:36:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:36:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:36:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:36:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:36:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:36:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:36:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:36:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:36:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:36:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:36:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:36:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:36:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:36:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:36:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:36:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:36:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:36:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:36:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:36:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:36:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:36:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:36:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:36:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:36:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:36:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:36:24,528 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:36:24,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:36:24,953 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-01-10 02:36:24,953 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:24,993 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:36:25,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:36:25,000 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-01-10 02:36:25,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:25 BoogieIcfgContainer [2022-01-10 02:36:25,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:36:25,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:36:25,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:36:25,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:36:25,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:36:23" (1/3) ... [2022-01-10 02:36:25,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335ca2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:25, skipping insertion in model container [2022-01-10 02:36:25,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:24" (2/3) ... [2022-01-10 02:36:25,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335ca2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:25, skipping insertion in model container [2022-01-10 02:36:25,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:25" (3/3) ... [2022-01-10 02:36:25,007 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.08.cil-1.c [2022-01-10 02:36:25,010 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:36:25,010 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:36:25,040 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:36:25,044 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:25,044 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:36:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 344 states have (on average 1.619186046511628) internal successors, (557), 350 states have internal predecessors, (557), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-01-10 02:36:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:25,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:25,085 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:25,086 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1055313032, now seen corresponding path program 1 times [2022-01-10 02:36:25,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:25,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681208384] [2022-01-10 02:36:25,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:25,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:25,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:25,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:25,449 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:25,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:25,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681208384] [2022-01-10 02:36:25,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681208384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:25,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:25,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:36:25,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901182831] [2022-01-10 02:36:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:25,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:36:25,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:36:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:36:25,481 INFO L87 Difference]: Start difference. First operand has 399 states, 344 states have (on average 1.619186046511628) internal successors, (557), 350 states have internal predecessors, (557), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) 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:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:26,525 INFO L93 Difference]: Finished difference Result 925 states and 1461 transitions. [2022-01-10 02:36:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:26,529 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:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:26,539 INFO L225 Difference]: With dead ends: 925 [2022-01-10 02:36:26,539 INFO L226 Difference]: Without dead ends: 540 [2022-01-10 02:36:26,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:26,545 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 752 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:26,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 2273 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:36:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-01-10 02:36:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 501. [2022-01-10 02:36:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 426 states have (on average 1.5070422535211268) internal successors, (642), 432 states have internal predecessors, (642), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-01-10 02:36:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 747 transitions. [2022-01-10 02:36:26,611 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 747 transitions. Word has length 65 [2022-01-10 02:36:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:26,611 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 747 transitions. [2022-01-10 02:36:26,611 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:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 747 transitions. [2022-01-10 02:36:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:26,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:26,614 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:26,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:36:26,615 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:26,615 INFO L85 PathProgramCache]: Analyzing trace with hash 623575608, now seen corresponding path program 1 times [2022-01-10 02:36:26,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:26,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930633477] [2022-01-10 02:36:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:26,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:26,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:26,695 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:26,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:26,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930633477] [2022-01-10 02:36:26,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930633477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:26,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:26,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:36:26,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685367521] [2022-01-10 02:36:26,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:26,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:36:26,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:36:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:36:26,698 INFO L87 Difference]: Start difference. First operand 501 states and 747 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:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:27,646 INFO L93 Difference]: Finished difference Result 898 states and 1313 transitions. [2022-01-10 02:36:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:36:27,647 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:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:27,650 INFO L225 Difference]: With dead ends: 898 [2022-01-10 02:36:27,650 INFO L226 Difference]: Without dead ends: 689 [2022-01-10 02:36:27,651 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:27,651 INFO L933 BasicCegarLoop]: 670 mSDtfsCounter, 1426 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:27,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1454 Valid, 2034 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:36:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-01-10 02:36:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 613. [2022-01-10 02:36:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 516 states have (on average 1.4883720930232558) internal successors, (768), 524 states have internal predecessors, (768), 64 states have call successors, (64), 28 states have call predecessors, (64), 31 states have return successors, (75), 64 states have call predecessors, (75), 62 states have call successors, (75) [2022-01-10 02:36:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 907 transitions. [2022-01-10 02:36:27,679 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 907 transitions. Word has length 65 [2022-01-10 02:36:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:27,679 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 907 transitions. [2022-01-10 02:36:27,679 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:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 907 transitions. [2022-01-10 02:36:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:27,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:27,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:36:27,682 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1405010502, now seen corresponding path program 1 times [2022-01-10 02:36:27,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:27,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134748510] [2022-01-10 02:36:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:27,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:27,746 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,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:27,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134748510] [2022-01-10 02:36:27,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134748510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:27,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:27,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:27,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314403366] [2022-01-10 02:36:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:27,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:27,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:27,748 INFO L87 Difference]: Start difference. First operand 613 states and 907 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:36:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:28,385 INFO L93 Difference]: Finished difference Result 1285 states and 1849 transitions. [2022-01-10 02:36:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:36:28,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-01-10 02:36:28,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:28,390 INFO L225 Difference]: With dead ends: 1285 [2022-01-10 02:36:28,391 INFO L226 Difference]: Without dead ends: 970 [2022-01-10 02:36:28,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:36:28,393 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 1529 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:28,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1571 Valid, 1599 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:36:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-01-10 02:36:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 894. [2022-01-10 02:36:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 742 states have (on average 1.4487870619946093) internal successors, (1075), 754 states have internal predecessors, (1075), 94 states have call successors, (94), 49 states have call predecessors, (94), 56 states have return successors, (113), 94 states have call predecessors, (113), 92 states have call successors, (113) [2022-01-10 02:36:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1282 transitions. [2022-01-10 02:36:28,440 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1282 transitions. Word has length 65 [2022-01-10 02:36:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:28,441 INFO L470 AbstractCegarLoop]: Abstraction has 894 states and 1282 transitions. [2022-01-10 02:36:28,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:36:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1282 transitions. [2022-01-10 02:36:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:36:28,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:28,444 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:28,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:36:28,444 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash 603910498, now seen corresponding path program 1 times [2022-01-10 02:36:28,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244724415] [2022-01-10 02:36:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:28,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:28,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 02:36:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 02:36:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:28,558 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:28,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:28,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244724415] [2022-01-10 02:36:28,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244724415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:28,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:28,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:36:28,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595328050] [2022-01-10 02:36:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:28,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:36:28,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:28,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:36:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:36:28,560 INFO L87 Difference]: Start difference. First operand 894 states and 1282 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:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:29,455 INFO L93 Difference]: Finished difference Result 1568 states and 2218 transitions. [2022-01-10 02:36:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:36:29,455 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:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:29,459 INFO L225 Difference]: With dead ends: 1568 [2022-01-10 02:36:29,459 INFO L226 Difference]: Without dead ends: 972 [2022-01-10 02:36:29,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:29,461 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 506 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:29,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 2575 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:36:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-01-10 02:36:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 909. [2022-01-10 02:36:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 754 states have (on average 1.4376657824933687) internal successors, (1084), 766 states have internal predecessors, (1084), 94 states have call successors, (94), 49 states have call predecessors, (94), 59 states have return successors, (116), 97 states have call predecessors, (116), 92 states have call successors, (116) [2022-01-10 02:36:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1294 transitions. [2022-01-10 02:36:29,492 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1294 transitions. Word has length 66 [2022-01-10 02:36:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:29,492 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1294 transitions. [2022-01-10 02:36:29,492 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:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1294 transitions. [2022-01-10 02:36:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:36:29,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:29,493 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:29,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:36:29,494 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -425448800, now seen corresponding path program 1 times [2022-01-10 02:36:29,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:29,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77963980] [2022-01-10 02:36:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:29,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:29,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 02:36:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 02:36:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:29,622 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:29,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:29,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77963980] [2022-01-10 02:36:29,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77963980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:29,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:29,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:36:29,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43200054] [2022-01-10 02:36:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:29,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:36:29,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:29,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:36:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:36:29,624 INFO L87 Difference]: Start difference. First operand 909 states and 1294 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:36:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:31,147 INFO L93 Difference]: Finished difference Result 3114 states and 4415 transitions. [2022-01-10 02:36:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:36:31,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 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:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:31,152 INFO L225 Difference]: With dead ends: 3114 [2022-01-10 02:36:31,152 INFO L226 Difference]: Without dead ends: 1272 [2022-01-10 02:36:31,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 02:36:31,157 INFO L933 BasicCegarLoop]: 856 mSDtfsCounter, 2435 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:31,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2458 Valid, 2343 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:36:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2022-01-10 02:36:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1117. [2022-01-10 02:36:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 906 states have (on average 1.3995584988962473) internal successors, (1268), 922 states have internal predecessors, (1268), 124 states have call successors, (124), 70 states have call predecessors, (124), 85 states have return successors, (165), 128 states have call predecessors, (165), 122 states have call successors, (165) [2022-01-10 02:36:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1557 transitions. [2022-01-10 02:36:31,201 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1557 transitions. Word has length 66 [2022-01-10 02:36:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:31,201 INFO L470 AbstractCegarLoop]: Abstraction has 1117 states and 1557 transitions. [2022-01-10 02:36:31,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:36:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1557 transitions. [2022-01-10 02:36:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 02:36:31,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:31,203 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] [2022-01-10 02:36:31,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:36:31,203 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:31,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash 661226175, now seen corresponding path program 1 times [2022-01-10 02:36:31,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:31,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632044777] [2022-01-10 02:36:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:31,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:36:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:36:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:36:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:31,317 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:31,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:31,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632044777] [2022-01-10 02:36:31,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632044777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:31,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:31,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:36:31,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741869470] [2022-01-10 02:36:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:31,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:36:31,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:36:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:36:31,322 INFO L87 Difference]: Start difference. First operand 1117 states and 1557 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:36:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:32,104 INFO L93 Difference]: Finished difference Result 2302 states and 3182 transitions. [2022-01-10 02:36:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 02:36:32,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2022-01-10 02:36:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:32,106 INFO L225 Difference]: With dead ends: 2302 [2022-01-10 02:36:32,106 INFO L226 Difference]: Without dead ends: 278 [2022-01-10 02:36:32,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:36:32,111 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 1502 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:32,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1544 Valid, 1916 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:36:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-01-10 02:36:32,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-01-10 02:36:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 249 states have (on average 1.5582329317269077) internal successors, (388), 250 states have internal predecessors, (388), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 02:36:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 432 transitions. [2022-01-10 02:36:32,119 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 432 transitions. Word has length 67 [2022-01-10 02:36:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:32,119 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 432 transitions. [2022-01-10 02:36:32,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:36:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 432 transitions. [2022-01-10 02:36:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:32,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:32,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:36:32,121 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:32,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:32,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1126190140, now seen corresponding path program 1 times [2022-01-10 02:36:32,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:32,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921995916] [2022-01-10 02:36:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:32,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,190 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:32,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:32,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921995916] [2022-01-10 02:36:32,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921995916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:32,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:32,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:36:32,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735960243] [2022-01-10 02:36:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:32,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:36:32,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:32,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:36:32,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:36:32,192 INFO L87 Difference]: Start difference. First operand 278 states and 432 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:32,886 INFO L93 Difference]: Finished difference Result 645 states and 1020 transitions. [2022-01-10 02:36:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:36:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:32,889 INFO L225 Difference]: With dead ends: 645 [2022-01-10 02:36:32,889 INFO L226 Difference]: Without dead ends: 376 [2022-01-10 02:36:32,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:36:32,893 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 728 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:32,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 761 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:36:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-01-10 02:36:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 278. [2022-01-10 02:36:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 249 states have (on average 1.5542168674698795) internal successors, (387), 250 states have internal predecessors, (387), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 02:36:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 431 transitions. [2022-01-10 02:36:32,910 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 431 transitions. Word has length 134 [2022-01-10 02:36:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:32,910 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 431 transitions. [2022-01-10 02:36:32,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 431 transitions. [2022-01-10 02:36:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:32,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:32,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:36:32,911 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash 179152254, now seen corresponding path program 1 times [2022-01-10 02:36:32,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:32,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967867157] [2022-01-10 02:36:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:32,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:32,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:33,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:33,005 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,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:33,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967867157] [2022-01-10 02:36:33,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967867157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:33,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:33,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:36:33,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709673315] [2022-01-10 02:36:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:33,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:36:33,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:36:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:36:33,007 INFO L87 Difference]: Start difference. First operand 278 states and 431 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:34,400 INFO L93 Difference]: Finished difference Result 1006 states and 1598 transitions. [2022-01-10 02:36:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:36:34,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:34,405 INFO L225 Difference]: With dead ends: 1006 [2022-01-10 02:36:34,405 INFO L226 Difference]: Without dead ends: 745 [2022-01-10 02:36:34,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:36:34,406 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 1093 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:34,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1108 Valid, 1204 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:36:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-01-10 02:36:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 550. [2022-01-10 02:36:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 497 states have (on average 1.567404426559356) internal successors, (779), 499 states have internal predecessors, (779), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-01-10 02:36:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 860 transitions. [2022-01-10 02:36:34,430 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 860 transitions. Word has length 134 [2022-01-10 02:36:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:34,430 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 860 transitions. [2022-01-10 02:36:34,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 860 transitions. [2022-01-10 02:36:34,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:34,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:34,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:36:34,432 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1527351294, now seen corresponding path program 1 times [2022-01-10 02:36:34,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:34,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383977096] [2022-01-10 02:36:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:34,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:34,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:34,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:34,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:34,531 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:34,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:34,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383977096] [2022-01-10 02:36:34,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383977096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:34,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:34,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:34,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040351228] [2022-01-10 02:36:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:34,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:34,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:34,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:34,533 INFO L87 Difference]: Start difference. First operand 550 states and 860 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:36,314 INFO L93 Difference]: Finished difference Result 1659 states and 2636 transitions. [2022-01-10 02:36:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:36,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:36,319 INFO L225 Difference]: With dead ends: 1659 [2022-01-10 02:36:36,319 INFO L226 Difference]: Without dead ends: 1126 [2022-01-10 02:36:36,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:36,322 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 1106 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:36,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1121 Valid, 2086 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 02:36:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2022-01-10 02:36:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 803. [2022-01-10 02:36:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 726 states have (on average 1.5606060606060606) internal successors, (1133), 729 states have internal predecessors, (1133), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2022-01-10 02:36:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1250 transitions. [2022-01-10 02:36:36,375 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1250 transitions. Word has length 134 [2022-01-10 02:36:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:36,375 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 1250 transitions. [2022-01-10 02:36:36,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1250 transitions. [2022-01-10 02:36:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:36,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:36,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:36:36,377 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 474534976, now seen corresponding path program 1 times [2022-01-10 02:36:36,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:36,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722451081] [2022-01-10 02:36:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:36,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:36,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:36,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:36,472 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:36,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722451081] [2022-01-10 02:36:36,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722451081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:36,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:36,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:36,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073628008] [2022-01-10 02:36:36,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:36,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:36,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:36,473 INFO L87 Difference]: Start difference. First operand 803 states and 1250 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:38,331 INFO L93 Difference]: Finished difference Result 2621 states and 4154 transitions. [2022-01-10 02:36:38,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:38,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:38,339 INFO L225 Difference]: With dead ends: 2621 [2022-01-10 02:36:38,339 INFO L226 Difference]: Without dead ends: 1835 [2022-01-10 02:36:38,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:38,343 INFO L933 BasicCegarLoop]: 712 mSDtfsCounter, 1106 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:38,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1121 Valid, 2076 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 02:36:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-01-10 02:36:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1310. [2022-01-10 02:36:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1185 states have (on average 1.5544303797468355) internal successors, (1842), 1190 states have internal predecessors, (1842), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2022-01-10 02:36:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2035 transitions. [2022-01-10 02:36:38,427 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2035 transitions. Word has length 134 [2022-01-10 02:36:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:38,427 INFO L470 AbstractCegarLoop]: Abstraction has 1310 states and 2035 transitions. [2022-01-10 02:36:38,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2035 transitions. [2022-01-10 02:36:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:38,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:38,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:36:38,430 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:38,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2093287358, now seen corresponding path program 1 times [2022-01-10 02:36:38,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:38,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137988967] [2022-01-10 02:36:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:38,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:38,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:38,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:36:38,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:38,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137988967] [2022-01-10 02:36:38,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137988967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:38,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:38,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:38,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845905441] [2022-01-10 02:36:38,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:38,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:38,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:38,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:38,549 INFO L87 Difference]: Start difference. First operand 1310 states and 2035 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:39,972 INFO L93 Difference]: Finished difference Result 4469 states and 7055 transitions. [2022-01-10 02:36:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:39,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:40,012 INFO L225 Difference]: With dead ends: 4469 [2022-01-10 02:36:40,012 INFO L226 Difference]: Without dead ends: 3176 [2022-01-10 02:36:40,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:40,015 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 1178 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:40,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1193 Valid, 1440 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:36:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2022-01-10 02:36:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 2330. [2022-01-10 02:36:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2109 states have (on average 1.5504978662873399) internal successors, (3270), 2118 states have internal predecessors, (3270), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2022-01-10 02:36:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3621 transitions. [2022-01-10 02:36:40,136 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3621 transitions. Word has length 134 [2022-01-10 02:36:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:40,136 INFO L470 AbstractCegarLoop]: Abstraction has 2330 states and 3621 transitions. [2022-01-10 02:36:40,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3621 transitions. [2022-01-10 02:36:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:40,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:40,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 02:36:40,138 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:40,138 INFO L85 PathProgramCache]: Analyzing trace with hash 554316996, now seen corresponding path program 1 times [2022-01-10 02:36:40,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:40,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042398850] [2022-01-10 02:36:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:40,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:40,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:40,219 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:40,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:40,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042398850] [2022-01-10 02:36:40,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042398850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:40,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:40,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:40,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707284242] [2022-01-10 02:36:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:40,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:40,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:40,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:40,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:40,220 INFO L87 Difference]: Start difference. First operand 2330 states and 3621 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:41,118 INFO L93 Difference]: Finished difference Result 5504 states and 8694 transitions. [2022-01-10 02:36:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:36:41,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:41,134 INFO L225 Difference]: With dead ends: 5504 [2022-01-10 02:36:41,135 INFO L226 Difference]: Without dead ends: 3191 [2022-01-10 02:36:41,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:36:41,187 INFO L933 BasicCegarLoop]: 447 mSDtfsCounter, 911 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:41,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 983 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:36:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2022-01-10 02:36:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 2330. [2022-01-10 02:36:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2109 states have (on average 1.5462304409672831) internal successors, (3261), 2118 states have internal predecessors, (3261), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2022-01-10 02:36:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3612 transitions. [2022-01-10 02:36:41,309 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3612 transitions. Word has length 134 [2022-01-10 02:36:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:41,310 INFO L470 AbstractCegarLoop]: Abstraction has 2330 states and 3612 transitions. [2022-01-10 02:36:41,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3612 transitions. [2022-01-10 02:36:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:41,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:41,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:36:41,312 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:41,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1577033726, now seen corresponding path program 1 times [2022-01-10 02:36:41,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:41,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164392782] [2022-01-10 02:36:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:41,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:36:41,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:41,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164392782] [2022-01-10 02:36:41,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164392782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:41,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:41,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:41,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568138169] [2022-01-10 02:36:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:41,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:41,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:41,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:41,410 INFO L87 Difference]: Start difference. First operand 2330 states and 3612 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:42,399 INFO L93 Difference]: Finished difference Result 5494 states and 8647 transitions. [2022-01-10 02:36:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:36:42,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:42,414 INFO L225 Difference]: With dead ends: 5494 [2022-01-10 02:36:42,415 INFO L226 Difference]: Without dead ends: 3181 [2022-01-10 02:36:42,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:36:42,424 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 791 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:42,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 1122 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:36:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2022-01-10 02:36:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2330. [2022-01-10 02:36:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2109 states have (on average 1.5419630156472262) internal successors, (3252), 2118 states have internal predecessors, (3252), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2022-01-10 02:36:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3603 transitions. [2022-01-10 02:36:42,607 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3603 transitions. Word has length 134 [2022-01-10 02:36:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:42,607 INFO L470 AbstractCegarLoop]: Abstraction has 2330 states and 3603 transitions. [2022-01-10 02:36:42,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3603 transitions. [2022-01-10 02:36:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:42,610 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:42,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:36:42,610 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1679348996, now seen corresponding path program 1 times [2022-01-10 02:36:42,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:42,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458514796] [2022-01-10 02:36:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:42,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:42,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:42,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:42,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:42,705 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:42,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:42,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458514796] [2022-01-10 02:36:42,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458514796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:42,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:42,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:42,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16576270] [2022-01-10 02:36:42,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:42,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:42,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:42,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:42,706 INFO L87 Difference]: Start difference. First operand 2330 states and 3603 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:43,650 INFO L93 Difference]: Finished difference Result 5484 states and 8600 transitions. [2022-01-10 02:36:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:36:43,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:43,661 INFO L225 Difference]: With dead ends: 5484 [2022-01-10 02:36:43,662 INFO L226 Difference]: Without dead ends: 3171 [2022-01-10 02:36:43,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:36:43,666 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 907 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:43,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [923 Valid, 975 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:36:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2022-01-10 02:36:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 2330. [2022-01-10 02:36:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2109 states have (on average 1.5376955903271692) internal successors, (3243), 2118 states have internal predecessors, (3243), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2022-01-10 02:36:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3594 transitions. [2022-01-10 02:36:43,792 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3594 transitions. Word has length 134 [2022-01-10 02:36:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:43,793 INFO L470 AbstractCegarLoop]: Abstraction has 2330 states and 3594 transitions. [2022-01-10 02:36:43,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3594 transitions. [2022-01-10 02:36:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:43,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:43,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:36:43,795 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:43,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:43,795 INFO L85 PathProgramCache]: Analyzing trace with hash -293816382, now seen corresponding path program 1 times [2022-01-10 02:36:43,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:43,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320366000] [2022-01-10 02:36:43,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:43,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:43,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:43,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:43,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:43,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:43,884 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:43,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:43,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320366000] [2022-01-10 02:36:43,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320366000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:43,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:43,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:43,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939652563] [2022-01-10 02:36:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:43,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:43,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:43,885 INFO L87 Difference]: Start difference. First operand 2330 states and 3594 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:45,934 INFO L93 Difference]: Finished difference Result 8145 states and 12699 transitions. [2022-01-10 02:36:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:45,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:45,953 INFO L225 Difference]: With dead ends: 8145 [2022-01-10 02:36:45,953 INFO L226 Difference]: Without dead ends: 5832 [2022-01-10 02:36:45,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:36:45,960 INFO L933 BasicCegarLoop]: 681 mSDtfsCounter, 1079 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:45,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 2045 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:36:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5832 states. [2022-01-10 02:36:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5832 to 4402. [2022-01-10 02:36:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4402 states, 3989 states have (on average 1.531962897969416) internal successors, (6111), 4006 states have internal predecessors, (6111), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2022-01-10 02:36:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4402 states to 4402 states and 6796 transitions. [2022-01-10 02:36:46,270 INFO L78 Accepts]: Start accepts. Automaton has 4402 states and 6796 transitions. Word has length 134 [2022-01-10 02:36:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:46,271 INFO L470 AbstractCegarLoop]: Abstraction has 4402 states and 6796 transitions. [2022-01-10 02:36:46,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4402 states and 6796 transitions. [2022-01-10 02:36:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:46,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:46,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 02:36:46,274 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:46,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1859290436, now seen corresponding path program 1 times [2022-01-10 02:36:46,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:46,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622542265] [2022-01-10 02:36:46,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:46,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:46,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:46,373 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:46,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:46,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622542265] [2022-01-10 02:36:46,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622542265] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:46,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:46,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:46,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490652724] [2022-01-10 02:36:46,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:46,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:46,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:46,376 INFO L87 Difference]: Start difference. First operand 4402 states and 6796 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:49,422 INFO L93 Difference]: Finished difference Result 17495 states and 27237 transitions. [2022-01-10 02:36:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:36:49,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:49,526 INFO L225 Difference]: With dead ends: 17495 [2022-01-10 02:36:49,526 INFO L226 Difference]: Without dead ends: 13110 [2022-01-10 02:36:49,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:49,556 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 1161 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:49,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1175 Valid, 2166 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-10 02:36:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13110 states. [2022-01-10 02:36:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13110 to 8507. [2022-01-10 02:36:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8507 states, 7726 states have (on average 1.5305462076106653) internal successors, (11825), 7759 states have internal predecessors, (11825), 550 states have call successors, (550), 198 states have call predecessors, (550), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2022-01-10 02:36:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 13200 transitions. [2022-01-10 02:36:50,259 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 13200 transitions. Word has length 134 [2022-01-10 02:36:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:50,259 INFO L470 AbstractCegarLoop]: Abstraction has 8507 states and 13200 transitions. [2022-01-10 02:36:50,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 13200 transitions. [2022-01-10 02:36:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:50,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:36:50,275 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:50,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1236008834, now seen corresponding path program 1 times [2022-01-10 02:36:50,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:50,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781946308] [2022-01-10 02:36:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:50,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:50,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:50,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:50,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:50,403 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:50,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:50,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781946308] [2022-01-10 02:36:50,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781946308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:50,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:50,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:50,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388782448] [2022-01-10 02:36:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:50,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:50,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:50,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:50,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:50,406 INFO L87 Difference]: Start difference. First operand 8507 states and 13200 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:54,583 INFO L93 Difference]: Finished difference Result 33726 states and 52747 transitions. [2022-01-10 02:36:54,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:36:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:36:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:54,666 INFO L225 Difference]: With dead ends: 33726 [2022-01-10 02:36:54,667 INFO L226 Difference]: Without dead ends: 25236 [2022-01-10 02:36:54,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:54,697 INFO L933 BasicCegarLoop]: 666 mSDtfsCounter, 1370 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:54,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1394 Valid, 2019 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 02:36:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25236 states. [2022-01-10 02:36:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25236 to 16540. [2022-01-10 02:36:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16540 states, 15039 states have (on average 1.5300884367311656) internal successors, (23011), 15104 states have internal predecessors, (23011), 1046 states have call successors, (1046), 390 states have call predecessors, (1046), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2022-01-10 02:36:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16540 states to 16540 states and 25896 transitions. [2022-01-10 02:36:56,135 INFO L78 Accepts]: Start accepts. Automaton has 16540 states and 25896 transitions. Word has length 134 [2022-01-10 02:36:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:56,135 INFO L470 AbstractCegarLoop]: Abstraction has 16540 states and 25896 transitions. [2022-01-10 02:36:56,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16540 states and 25896 transitions. [2022-01-10 02:36:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:36:56,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:56,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:36:56,150 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1354450308, now seen corresponding path program 1 times [2022-01-10 02:36:56,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:56,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988580496] [2022-01-10 02:36:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:56,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:36:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:36:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:36:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:36:56,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:56,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988580496] [2022-01-10 02:36:56,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988580496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:56,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:56,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:36:56,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672382703] [2022-01-10 02:36:56,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:56,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:36:56,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:56,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:36:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:36:56,256 INFO L87 Difference]: Start difference. First operand 16540 states and 25896 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:37:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:02,441 INFO L93 Difference]: Finished difference Result 64155 states and 101261 transitions. [2022-01-10 02:37:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:37:02,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:37:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:02,591 INFO L225 Difference]: With dead ends: 64155 [2022-01-10 02:37:02,591 INFO L226 Difference]: Without dead ends: 47632 [2022-01-10 02:37:02,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:37:02,638 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 1351 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:02,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1375 Valid, 1408 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:37:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47632 states. [2022-01-10 02:37:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47632 to 32798. [2022-01-10 02:37:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32798 states, 29889 states have (on average 1.5323028538927363) internal successors, (45799), 30018 states have internal predecessors, (45799), 2006 states have call successors, (2006), 774 states have call predecessors, (2006), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2022-01-10 02:37:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32798 states to 32798 states and 52126 transitions. [2022-01-10 02:37:05,317 INFO L78 Accepts]: Start accepts. Automaton has 32798 states and 52126 transitions. Word has length 134 [2022-01-10 02:37:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:05,317 INFO L470 AbstractCegarLoop]: Abstraction has 32798 states and 52126 transitions. [2022-01-10 02:37:05,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:37:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 32798 states and 52126 transitions. [2022-01-10 02:37:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:37:05,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:05,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:05,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 02:37:05,332 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:05,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash -678943738, now seen corresponding path program 1 times [2022-01-10 02:37:05,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:05,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892055563] [2022-01-10 02:37:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:05,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:05,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:37:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:05,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:37:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:05,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:37:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:05,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:37:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:05,414 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:37:05,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:05,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892055563] [2022-01-10 02:37:05,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892055563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:05,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:05,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:05,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812421858] [2022-01-10 02:37:05,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:05,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:05,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:05,416 INFO L87 Difference]: Start difference. First operand 32798 states and 52126 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:37:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:16,141 INFO L93 Difference]: Finished difference Result 125275 states and 200597 transitions. [2022-01-10 02:37:16,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:37:16,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2022-01-10 02:37:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:16,418 INFO L225 Difference]: With dead ends: 125275 [2022-01-10 02:37:16,418 INFO L226 Difference]: Without dead ends: 92494 [2022-01-10 02:37:16,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:37:16,504 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 1248 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:16,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1272 Valid, 2009 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 02:37:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92494 states. [2022-01-10 02:37:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92494 to 65247. [2022-01-10 02:37:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65247 states, 59586 states have (on average 1.5344711845064276) internal successors, (91433), 59843 states have internal predecessors, (91433), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2022-01-10 02:37:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65247 states to 65247 states and 105974 transitions. [2022-01-10 02:37:22,429 INFO L78 Accepts]: Start accepts. Automaton has 65247 states and 105974 transitions. Word has length 134 [2022-01-10 02:37:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:22,429 INFO L470 AbstractCegarLoop]: Abstraction has 65247 states and 105974 transitions. [2022-01-10 02:37:22,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:37:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 65247 states and 105974 transitions. [2022-01-10 02:37:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-10 02:37:22,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:22,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:22,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:37:22,457 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:22,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:22,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1749314884, now seen corresponding path program 1 times [2022-01-10 02:37:22,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:22,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25151179] [2022-01-10 02:37:22,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:22,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:37:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:22,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:37:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:37:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:37:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:37:22,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25151179] [2022-01-10 02:37:22,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25151179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:22,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:22,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:22,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414505386] [2022-01-10 02:37:22,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:22,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:22,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:22,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:22,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:22,547 INFO L87 Difference]: Start difference. First operand 65247 states and 105974 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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)