./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:47:40,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:47:40,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:47:40,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:47:40,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:47:40,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:47:40,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:47:40,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:47:40,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:47:40,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:47:40,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:47:40,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:47:40,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:47:40,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:47:40,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:47:40,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:47:40,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:47:40,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 [2024-11-07 01:47:40,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:47:40,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:47:40,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:47:40,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:47:40,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:47:40,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2024-11-07 01:47:41,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:47:42,220 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:47:42,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2024-11-07 01:47:42,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5df79ce9c/da7d8ebb5903423eb32ccd07327a1212/FLAG3da85accb [2024-11-07 01:47:42,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5df79ce9c/da7d8ebb5903423eb32ccd07327a1212 [2024-11-07 01:47:42,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:47:42,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:47:42,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:47:42,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:47:42,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:47:42,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d771f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42, skipping insertion in model container [2024-11-07 01:47:42,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:47:42,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c[911,924] [2024-11-07 01:47:42,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c[8416,8429] [2024-11-07 01:47:42,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:47:42,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:47:42,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c[911,924] [2024-11-07 01:47:42,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c[8416,8429] [2024-11-07 01:47:42,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:47:42,829 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:47:42,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42 WrapperNode [2024-11-07 01:47:42,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:47:42,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:47:42,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:47:42,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:47:42,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,883 INFO L138 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 566 [2024-11-07 01:47:42,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:47:42,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:47:42,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:47:42,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:47:42,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,923 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:47:42,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:47:42,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:47:42,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:47:42,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:47:42,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (1/1) ... [2024-11-07 01:47:42,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:47:42,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:47:42,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:47:42,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:47:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:47:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:47:43,008 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:47:43,008 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:47:43,008 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:47:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:47:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:47:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:47:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:47:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:47:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:47:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:47:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:47:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:47:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:47:43,009 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:47:43,009 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:47:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:47:43,010 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:47:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:47:43,010 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:47:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:47:43,010 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:47:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:47:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:47:43,010 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:47:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:47:43,010 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:47:43,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:47:43,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:47:43,011 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:47:43,011 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:47:43,093 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:47:43,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:47:43,442 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-07 01:47:43,443 INFO L735 $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; [2024-11-07 01:47:43,519 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-07 01:47:43,520 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:47:43,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:47:43,536 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-07 01:47:43,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:43 BoogieIcfgContainer [2024-11-07 01:47:43,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:47:43,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:47:43,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:47:43,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:47:43,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:47:42" (1/3) ... [2024-11-07 01:47:43,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382700ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:47:43, skipping insertion in model container [2024-11-07 01:47:43,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:42" (2/3) ... [2024-11-07 01:47:43,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382700ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:47:43, skipping insertion in model container [2024-11-07 01:47:43,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:43" (3/3) ... [2024-11-07 01:47:43,545 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-2.c [2024-11-07 01:47:43,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:47:43,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:47:43,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:47:43,601 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70cd7a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:47:43,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:47:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 278 states, 228 states have (on average 1.5614035087719298) internal successors, (356), 234 states have internal predecessors, (356), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 01:47:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:47:43,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:43,613 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:43,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:43,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1984848267, now seen corresponding path program 1 times [2024-11-07 01:47:43,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:43,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175902683] [2024-11-07 01:47:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:43,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:44,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:44,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175902683] [2024-11-07 01:47:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175902683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:44,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:47:44,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299847223] [2024-11-07 01:47:44,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:44,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:47:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:47:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:47:44,084 INFO L87 Difference]: Start difference. First operand has 278 states, 228 states have (on average 1.5614035087719298) internal successors, (356), 234 states have internal predecessors, (356), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) 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) [2024-11-07 01:47:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:44,990 INFO L93 Difference]: Finished difference Result 688 states and 1049 transitions. [2024-11-07 01:47:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:44,995 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 [2024-11-07 01:47:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:45,007 INFO L225 Difference]: With dead ends: 688 [2024-11-07 01:47:45,007 INFO L226 Difference]: Without dead ends: 419 [2024-11-07 01:47:45,011 INFO L431 NwaCegarLoop]: 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 [2024-11-07 01:47:45,014 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 565 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:45,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1180 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:47:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-07 01:47:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 380. [2024-11-07 01:47:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 310 states have (on average 1.4548387096774194) internal successors, (451), 316 states have internal predecessors, (451), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-07 01:47:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 546 transitions. [2024-11-07 01:47:45,079 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 546 transitions. Word has length 65 [2024-11-07 01:47:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:45,079 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 546 transitions. [2024-11-07 01:47:45,079 INFO L472 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) [2024-11-07 01:47:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 546 transitions. [2024-11-07 01:47:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:47:45,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:45,082 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:45,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:47:45,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:45,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash -305959627, now seen corresponding path program 1 times [2024-11-07 01:47:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:45,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094324952] [2024-11-07 01:47:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094324952] [2024-11-07 01:47:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094324952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:45,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:45,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:47:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705565043] [2024-11-07 01:47:45,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:45,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:47:45,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:45,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:47:45,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:47:45,290 INFO L87 Difference]: Start difference. First operand 380 states and 546 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) [2024-11-07 01:47:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:46,172 INFO L93 Difference]: Finished difference Result 777 states and 1112 transitions. [2024-11-07 01:47:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:47:46,173 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 [2024-11-07 01:47:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:46,177 INFO L225 Difference]: With dead ends: 777 [2024-11-07 01:47:46,177 INFO L226 Difference]: Without dead ends: 568 [2024-11-07 01:47:46,182 INFO L431 NwaCegarLoop]: 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 [2024-11-07 01:47:46,183 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 927 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:46,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1298 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:47:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-07 01:47:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 492. [2024-11-07 01:47:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 400 states have (on average 1.4425) internal successors, (577), 408 states have internal predecessors, (577), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2024-11-07 01:47:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 706 transitions. [2024-11-07 01:47:46,235 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 706 transitions. Word has length 65 [2024-11-07 01:47:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:46,235 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 706 transitions. [2024-11-07 01:47:46,236 INFO L472 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) [2024-11-07 01:47:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 706 transitions. [2024-11-07 01:47:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:47:46,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:46,240 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:46,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:47:46,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1960421559, now seen corresponding path program 1 times [2024-11-07 01:47:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128154387] [2024-11-07 01:47:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:47:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:47:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:47:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:46,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128154387] [2024-11-07 01:47:46,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128154387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:46,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:46,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:46,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279534711] [2024-11-07 01:47:46,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:46,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:46,361 INFO L87 Difference]: Start difference. First operand 492 states and 706 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) [2024-11-07 01:47:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:47,092 INFO L93 Difference]: Finished difference Result 1164 states and 1648 transitions. [2024-11-07 01:47:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:47:47,092 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 [2024-11-07 01:47:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:47,099 INFO L225 Difference]: With dead ends: 1164 [2024-11-07 01:47:47,099 INFO L226 Difference]: Without dead ends: 849 [2024-11-07 01:47:47,101 INFO L431 NwaCegarLoop]: 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 [2024-11-07 01:47:47,103 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 864 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:47,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1157 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:47:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-07 01:47:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 773. [2024-11-07 01:47:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 626 states have (on average 1.4121405750798721) internal successors, (884), 638 states have internal predecessors, (884), 89 states have call successors, (89), 49 states have call predecessors, (89), 56 states have return successors, (108), 89 states have call predecessors, (108), 87 states have call successors, (108) [2024-11-07 01:47:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1081 transitions. [2024-11-07 01:47:47,178 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1081 transitions. Word has length 65 [2024-11-07 01:47:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:47,179 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1081 transitions. [2024-11-07 01:47:47,179 INFO L472 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) [2024-11-07 01:47:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1081 transitions. [2024-11-07 01:47:47,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:47:47,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:47,183 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:47,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:47:47,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1913522978, now seen corresponding path program 1 times [2024-11-07 01:47:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335409129] [2024-11-07 01:47:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:47:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:47:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:47,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:47,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335409129] [2024-11-07 01:47:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335409129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:47,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394506414] [2024-11-07 01:47:47,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:47,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:47,328 INFO L87 Difference]: Start difference. First operand 773 states and 1081 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) [2024-11-07 01:47:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:47,984 INFO L93 Difference]: Finished difference Result 1441 states and 2008 transitions. [2024-11-07 01:47:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:47:47,985 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 [2024-11-07 01:47:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:47,992 INFO L225 Difference]: With dead ends: 1441 [2024-11-07 01:47:47,993 INFO L226 Difference]: Without dead ends: 845 [2024-11-07 01:47:47,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:47:47,995 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 304 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:47,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1580 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:47:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-07 01:47:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 788. [2024-11-07 01:47:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 638 states have (on average 1.3996865203761755) internal successors, (893), 650 states have internal predecessors, (893), 89 states have call successors, (89), 49 states have call predecessors, (89), 59 states have return successors, (111), 92 states have call predecessors, (111), 87 states have call successors, (111) [2024-11-07 01:47:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1093 transitions. [2024-11-07 01:47:48,052 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1093 transitions. Word has length 66 [2024-11-07 01:47:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:48,052 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1093 transitions. [2024-11-07 01:47:48,052 INFO L472 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) [2024-11-07 01:47:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1093 transitions. [2024-11-07 01:47:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:47:48,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:48,053 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:48,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:47:48,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1352085020, now seen corresponding path program 1 times [2024-11-07 01:47:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:48,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886318187] [2024-11-07 01:47:48,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:48,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:48,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:48,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:47:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:47:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:47:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:48,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886318187] [2024-11-07 01:47:48,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886318187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:48,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:48,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:48,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884484037] [2024-11-07 01:47:48,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:48,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:48,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:48,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:48,179 INFO L87 Difference]: Start difference. First operand 788 states and 1093 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) [2024-11-07 01:47:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:49,766 INFO L93 Difference]: Finished difference Result 2993 states and 4214 transitions. [2024-11-07 01:47:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:47:49,767 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 [2024-11-07 01:47:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:49,772 INFO L225 Difference]: With dead ends: 2993 [2024-11-07 01:47:49,772 INFO L226 Difference]: Without dead ends: 1151 [2024-11-07 01:47:49,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:47:49,777 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1576 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:49,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 1787 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:47:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-07 01:47:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 996. [2024-11-07 01:47:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 790 states have (on average 1.3632911392405063) internal successors, (1077), 806 states have internal predecessors, (1077), 119 states have call successors, (119), 70 states have call predecessors, (119), 85 states have return successors, (160), 123 states have call predecessors, (160), 117 states have call successors, (160) [2024-11-07 01:47:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1356 transitions. [2024-11-07 01:47:49,844 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1356 transitions. Word has length 66 [2024-11-07 01:47:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:49,844 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1356 transitions. [2024-11-07 01:47:49,844 INFO L472 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) [2024-11-07 01:47:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1356 transitions. [2024-11-07 01:47:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:47:49,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:49,845 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:49,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:47:49,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 372285316, now seen corresponding path program 1 times [2024-11-07 01:47:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:49,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412498050] [2024-11-07 01:47:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:47:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:47:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:47:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:47:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:47:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:47:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:49,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412498050] [2024-11-07 01:47:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412498050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:49,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:49,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:47:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305913421] [2024-11-07 01:47:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:49,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:47:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:49,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:47:49,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:47:49,984 INFO L87 Difference]: Start difference. First operand 996 states and 1356 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) [2024-11-07 01:47:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:50,727 INFO L93 Difference]: Finished difference Result 2181 states and 2981 transitions. [2024-11-07 01:47:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 01:47:50,728 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 [2024-11-07 01:47:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:50,730 INFO L225 Difference]: With dead ends: 2181 [2024-11-07 01:47:50,731 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 01:47:50,734 INFO L431 NwaCegarLoop]: 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 [2024-11-07 01:47:50,735 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 1089 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:50,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1116 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:47:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 01:47:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-07 01:47:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 133 states have (on average 1.481203007518797) internal successors, (197), 134 states have internal predecessors, (197), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 01:47:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2024-11-07 01:47:50,747 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 67 [2024-11-07 01:47:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:50,747 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2024-11-07 01:47:50,749 INFO L472 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) [2024-11-07 01:47:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2024-11-07 01:47:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:50,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:50,750 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:50,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:47:50,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:50,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash -946418630, now seen corresponding path program 1 times [2024-11-07 01:47:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383886507] [2024-11-07 01:47:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383886507] [2024-11-07 01:47:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383886507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:50,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:50,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:47:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584919321] [2024-11-07 01:47:50,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:50,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:47:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:47:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:47:50,832 INFO L87 Difference]: Start difference. First operand 157 states and 231 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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) [2024-11-07 01:47:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:51,194 INFO L93 Difference]: Finished difference Result 348 states and 523 transitions. [2024-11-07 01:47:51,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:47:51,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:51,196 INFO L225 Difference]: With dead ends: 348 [2024-11-07 01:47:51,196 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 01:47:51,197 INFO L431 NwaCegarLoop]: 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 [2024-11-07 01:47:51,198 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 361 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:51,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 316 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:47:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 01:47:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 157. [2024-11-07 01:47:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 134 states have internal predecessors, (196), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 01:47:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 230 transitions. [2024-11-07 01:47:51,209 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 230 transitions. Word has length 79 [2024-11-07 01:47:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:51,210 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 230 transitions. [2024-11-07 01:47:51,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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) [2024-11-07 01:47:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 230 transitions. [2024-11-07 01:47:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:51,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:51,211 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:51,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:47:51,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:51,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash -453792456, now seen corresponding path program 1 times [2024-11-07 01:47:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:51,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042688888] [2024-11-07 01:47:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042688888] [2024-11-07 01:47:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042688888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:47:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016282970] [2024-11-07 01:47:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:51,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:47:51,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:51,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:47:51,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:47:51,316 INFO L87 Difference]: Start difference. First operand 157 states and 230 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-07 01:47:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:51,935 INFO L93 Difference]: Finished difference Result 533 states and 805 transitions. [2024-11-07 01:47:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:47:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:51,938 INFO L225 Difference]: With dead ends: 533 [2024-11-07 01:47:51,938 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 01:47:51,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:51,939 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 530 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:51,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 534 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:47:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 01:47:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 303. [2024-11-07 01:47:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.4884615384615385) internal successors, (387), 262 states have internal predecessors, (387), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-11-07 01:47:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 448 transitions. [2024-11-07 01:47:51,965 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 448 transitions. Word has length 79 [2024-11-07 01:47:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:51,965 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 448 transitions. [2024-11-07 01:47:51,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-07 01:47:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 448 transitions. [2024-11-07 01:47:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:51,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:51,966 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:51,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:47:51,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:51,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash -216744260, now seen corresponding path program 1 times [2024-11-07 01:47:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756784885] [2024-11-07 01:47:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:52,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756784885] [2024-11-07 01:47:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756784885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:52,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:52,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330866929] [2024-11-07 01:47:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:52,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:52,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:52,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:52,068 INFO L87 Difference]: Start difference. First operand 303 states and 448 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:52,897 INFO L93 Difference]: Finished difference Result 869 states and 1306 transitions. [2024-11-07 01:47:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:52,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:52,900 INFO L225 Difference]: With dead ends: 869 [2024-11-07 01:47:52,900 INFO L226 Difference]: Without dead ends: 578 [2024-11-07 01:47:52,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:47:52,902 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 527 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:52,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 996 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:47:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-07 01:47:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 440. [2024-11-07 01:47:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 378 states have (on average 1.4814814814814814) internal successors, (560), 381 states have internal predecessors, (560), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-11-07 01:47:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 647 transitions. [2024-11-07 01:47:52,925 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 647 transitions. Word has length 79 [2024-11-07 01:47:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:52,925 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 647 transitions. [2024-11-07 01:47:52,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 647 transitions. [2024-11-07 01:47:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:52,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:52,926 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:52,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:47:52,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -271137158, now seen corresponding path program 1 times [2024-11-07 01:47:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129264035] [2024-11-07 01:47:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:53,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129264035] [2024-11-07 01:47:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129264035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:53,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:53,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:53,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445478328] [2024-11-07 01:47:53,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:53,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:53,030 INFO L87 Difference]: Start difference. First operand 440 states and 647 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:53,889 INFO L93 Difference]: Finished difference Result 1363 states and 2041 transitions. [2024-11-07 01:47:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:53,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:53,894 INFO L225 Difference]: With dead ends: 1363 [2024-11-07 01:47:53,894 INFO L226 Difference]: Without dead ends: 935 [2024-11-07 01:47:53,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:47:53,896 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 525 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:53,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 994 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:47:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-07 01:47:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 715. [2024-11-07 01:47:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 615 states have (on average 1.4747967479674797) internal successors, (907), 620 states have internal predecessors, (907), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-11-07 01:47:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1050 transitions. [2024-11-07 01:47:53,952 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1050 transitions. Word has length 79 [2024-11-07 01:47:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:53,952 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1050 transitions. [2024-11-07 01:47:53,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1050 transitions. [2024-11-07 01:47:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:53,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:53,954 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:53,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:47:53,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:53,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -688533764, now seen corresponding path program 1 times [2024-11-07 01:47:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:53,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130225613] [2024-11-07 01:47:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:54,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130225613] [2024-11-07 01:47:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130225613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:54,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:54,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709176637] [2024-11-07 01:47:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:54,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:54,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:54,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:54,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:54,059 INFO L87 Difference]: Start difference. First operand 715 states and 1050 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:54,792 INFO L93 Difference]: Finished difference Result 2318 states and 3460 transitions. [2024-11-07 01:47:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:47:54,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:54,800 INFO L225 Difference]: With dead ends: 2318 [2024-11-07 01:47:54,800 INFO L226 Difference]: Without dead ends: 1615 [2024-11-07 01:47:54,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:47:54,802 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 521 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:54,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 994 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:47:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-07 01:47:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1266. [2024-11-07 01:47:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1090 states have (on average 1.4688073394495413) internal successors, (1601), 1099 states have internal predecessors, (1601), 113 states have call successors, (113), 54 states have call predecessors, (113), 62 states have return successors, (148), 120 states have call predecessors, (148), 113 states have call successors, (148) [2024-11-07 01:47:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1862 transitions. [2024-11-07 01:47:54,882 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1862 transitions. Word has length 79 [2024-11-07 01:47:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:54,882 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1862 transitions. [2024-11-07 01:47:54,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1862 transitions. [2024-11-07 01:47:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:54,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:54,883 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:54,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:47:54,884 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:54,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash -9261510, now seen corresponding path program 1 times [2024-11-07 01:47:54,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:54,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714709295] [2024-11-07 01:47:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:54,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714709295] [2024-11-07 01:47:54,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714709295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:54,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:54,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:54,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274545443] [2024-11-07 01:47:54,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:54,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:54,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:54,990 INFO L87 Difference]: Start difference. First operand 1266 states and 1862 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:55,483 INFO L93 Difference]: Finished difference Result 2866 states and 4291 transitions. [2024-11-07 01:47:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:47:55,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:55,490 INFO L225 Difference]: With dead ends: 2866 [2024-11-07 01:47:55,490 INFO L226 Difference]: Without dead ends: 1612 [2024-11-07 01:47:55,493 INFO L431 NwaCegarLoop]: 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 [2024-11-07 01:47:55,493 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 414 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:55,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 495 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:47:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2024-11-07 01:47:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1266. [2024-11-07 01:47:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1090 states have (on average 1.4605504587155964) internal successors, (1592), 1099 states have internal predecessors, (1592), 113 states have call successors, (113), 54 states have call predecessors, (113), 62 states have return successors, (148), 120 states have call predecessors, (148), 113 states have call successors, (148) [2024-11-07 01:47:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1853 transitions. [2024-11-07 01:47:55,571 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1853 transitions. Word has length 79 [2024-11-07 01:47:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:55,571 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1853 transitions. [2024-11-07 01:47:55,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1853 transitions. [2024-11-07 01:47:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:55,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:55,573 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:55,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:47:55,573 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:55,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:55,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1952313148, now seen corresponding path program 1 times [2024-11-07 01:47:55,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:55,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469757220] [2024-11-07 01:47:55,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:55,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469757220] [2024-11-07 01:47:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469757220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:55,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:55,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076292622] [2024-11-07 01:47:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:55,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:55,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:55,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:55,672 INFO L87 Difference]: Start difference. First operand 1266 states and 1853 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:56,655 INFO L93 Difference]: Finished difference Result 4528 states and 6708 transitions. [2024-11-07 01:47:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:47:56,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:56,669 INFO L225 Difference]: With dead ends: 4528 [2024-11-07 01:47:56,669 INFO L226 Difference]: Without dead ends: 3274 [2024-11-07 01:47:56,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:47:56,672 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 610 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:56,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 980 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:47:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2024-11-07 01:47:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2317. [2024-11-07 01:47:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 1997 states have (on average 1.4556835252879319) internal successors, (2907), 2014 states have internal predecessors, (2907), 201 states have call successors, (201), 102 states have call predecessors, (201), 118 states have return successors, (298), 216 states have call predecessors, (298), 201 states have call successors, (298) [2024-11-07 01:47:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 3406 transitions. [2024-11-07 01:47:56,820 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 3406 transitions. Word has length 79 [2024-11-07 01:47:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:56,821 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 3406 transitions. [2024-11-07 01:47:56,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3406 transitions. [2024-11-07 01:47:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:56,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:56,824 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:56,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:47:56,824 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2140830214, now seen corresponding path program 1 times [2024-11-07 01:47:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129367890] [2024-11-07 01:47:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:56,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:56,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129367890] [2024-11-07 01:47:56,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129367890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:56,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:56,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82353735] [2024-11-07 01:47:56,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:56,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:56,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:56,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:56,917 INFO L87 Difference]: Start difference. First operand 2317 states and 3406 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:58,045 INFO L93 Difference]: Finished difference Result 8017 states and 11911 transitions. [2024-11-07 01:47:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:47:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:58,062 INFO L225 Difference]: With dead ends: 8017 [2024-11-07 01:47:58,062 INFO L226 Difference]: Without dead ends: 5712 [2024-11-07 01:47:58,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:47:58,067 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 526 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:58,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 984 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:47:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2024-11-07 01:47:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 4464. [2024-11-07 01:47:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4464 states, 3864 states have (on average 1.4583333333333333) internal successors, (5635), 3897 states have internal predecessors, (5635), 369 states have call successors, (369), 198 states have call predecessors, (369), 230 states have return successors, (644), 400 states have call predecessors, (644), 369 states have call successors, (644) [2024-11-07 01:47:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4464 states to 4464 states and 6648 transitions. [2024-11-07 01:47:58,356 INFO L78 Accepts]: Start accepts. Automaton has 4464 states and 6648 transitions. Word has length 79 [2024-11-07 01:47:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:58,356 INFO L471 AbstractCegarLoop]: Abstraction has 4464 states and 6648 transitions. [2024-11-07 01:47:58,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4464 states and 6648 transitions. [2024-11-07 01:47:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:58,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:58,361 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:58,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:47:58,361 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:58,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:58,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1707101128, now seen corresponding path program 1 times [2024-11-07 01:47:58,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:58,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428994863] [2024-11-07 01:47:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:58,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:58,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428994863] [2024-11-07 01:47:58,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428994863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:58,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:58,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:47:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175219057] [2024-11-07 01:47:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:58,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:47:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:58,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:47:58,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:47:58,453 INFO L87 Difference]: Start difference. First operand 4464 states and 6648 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:47:59,266 INFO L93 Difference]: Finished difference Result 9974 states and 14995 transitions. [2024-11-07 01:47:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:47:59,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:47:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:47:59,286 INFO L225 Difference]: With dead ends: 9974 [2024-11-07 01:47:59,286 INFO L226 Difference]: Without dead ends: 5523 [2024-11-07 01:47:59,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:47:59,296 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 183 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:47:59,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 687 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:47:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2024-11-07 01:47:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 4563. [2024-11-07 01:47:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4563 states, 3963 states have (on average 1.4468836739843554) internal successors, (5734), 3996 states have internal predecessors, (5734), 369 states have call successors, (369), 198 states have call predecessors, (369), 230 states have return successors, (644), 400 states have call predecessors, (644), 369 states have call successors, (644) [2024-11-07 01:47:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 6747 transitions. [2024-11-07 01:47:59,564 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 6747 transitions. Word has length 79 [2024-11-07 01:47:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:47:59,566 INFO L471 AbstractCegarLoop]: Abstraction has 4563 states and 6747 transitions. [2024-11-07 01:47:59,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:47:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 6747 transitions. [2024-11-07 01:47:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:47:59,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:47:59,569 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:47:59,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:47:59,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:47:59,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:47:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1722619846, now seen corresponding path program 1 times [2024-11-07 01:47:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:47:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477364078] [2024-11-07 01:47:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:47:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:47:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:47:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:47:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:47:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:47:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:47:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:47:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:47:59,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:47:59,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477364078] [2024-11-07 01:47:59,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477364078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:47:59,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:47:59,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:47:59,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629925282] [2024-11-07 01:47:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:47:59,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:47:59,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:47:59,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:47:59,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:47:59,650 INFO L87 Difference]: Start difference. First operand 4563 states and 6747 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-07 01:48:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:00,869 INFO L93 Difference]: Finished difference Result 15384 states and 22808 transitions. [2024-11-07 01:48:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:00,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-07 01:48:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:00,901 INFO L225 Difference]: With dead ends: 15384 [2024-11-07 01:48:00,901 INFO L226 Difference]: Without dead ends: 10834 [2024-11-07 01:48:00,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:48:00,912 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 731 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:00,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 746 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10834 states. [2024-11-07 01:48:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10834 to 8879. [2024-11-07 01:48:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8879 states, 7717 states have (on average 1.4414928080860439) internal successors, (11124), 7782 states have internal predecessors, (11124), 701 states have call successors, (701), 396 states have call predecessors, (701), 460 states have return successors, (1220), 732 states have call predecessors, (1220), 701 states have call successors, (1220) [2024-11-07 01:48:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 13045 transitions. [2024-11-07 01:48:01,470 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 13045 transitions. Word has length 79 [2024-11-07 01:48:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:01,471 INFO L471 AbstractCegarLoop]: Abstraction has 8879 states and 13045 transitions. [2024-11-07 01:48:01,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-07 01:48:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 13045 transitions. [2024-11-07 01:48:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:01,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:01,475 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:01,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:48:01,475 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:01,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 678905275, now seen corresponding path program 1 times [2024-11-07 01:48:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960093109] [2024-11-07 01:48:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:01,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960093109] [2024-11-07 01:48:01,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960093109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:01,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:01,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098828383] [2024-11-07 01:48:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:01,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:01,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:01,574 INFO L87 Difference]: Start difference. First operand 8879 states and 13045 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:48:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:02,710 INFO L93 Difference]: Finished difference Result 19830 states and 29338 transitions. [2024-11-07 01:48:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:48:02,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:48:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:02,752 INFO L225 Difference]: With dead ends: 19830 [2024-11-07 01:48:02,752 INFO L226 Difference]: Without dead ends: 10964 [2024-11-07 01:48:02,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:48:02,774 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 196 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:02,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 687 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:02,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2024-11-07 01:48:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 8978. [2024-11-07 01:48:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8978 states, 7816 states have (on average 1.4316786079836232) internal successors, (11190), 7881 states have internal predecessors, (11190), 701 states have call successors, (701), 396 states have call predecessors, (701), 460 states have return successors, (1220), 732 states have call predecessors, (1220), 701 states have call successors, (1220) [2024-11-07 01:48:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8978 states to 8978 states and 13111 transitions. [2024-11-07 01:48:03,471 INFO L78 Accepts]: Start accepts. Automaton has 8978 states and 13111 transitions. Word has length 79 [2024-11-07 01:48:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:03,471 INFO L471 AbstractCegarLoop]: Abstraction has 8978 states and 13111 transitions. [2024-11-07 01:48:03,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:48:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 8978 states and 13111 transitions. [2024-11-07 01:48:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:03,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:03,475 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:03,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:48:03,475 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:03,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash -218488003, now seen corresponding path program 1 times [2024-11-07 01:48:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562833841] [2024-11-07 01:48:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562833841] [2024-11-07 01:48:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562833841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682539832] [2024-11-07 01:48:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:03,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:03,557 INFO L87 Difference]: Start difference. First operand 8978 states and 13111 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:48:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:04,520 INFO L93 Difference]: Finished difference Result 20325 states and 29800 transitions. [2024-11-07 01:48:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:48:04,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:48:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:04,554 INFO L225 Difference]: With dead ends: 20325 [2024-11-07 01:48:04,554 INFO L226 Difference]: Without dead ends: 11360 [2024-11-07 01:48:04,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:48:04,571 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 206 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:04,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 687 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:48:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11360 states. [2024-11-07 01:48:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11360 to 9176. [2024-11-07 01:48:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9176 states, 8014 states have (on average 1.4210132268530071) internal successors, (11388), 8079 states have internal predecessors, (11388), 701 states have call successors, (701), 396 states have call predecessors, (701), 460 states have return successors, (1220), 732 states have call predecessors, (1220), 701 states have call successors, (1220) [2024-11-07 01:48:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 13309 transitions. [2024-11-07 01:48:05,086 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 13309 transitions. Word has length 79 [2024-11-07 01:48:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:05,086 INFO L471 AbstractCegarLoop]: Abstraction has 9176 states and 13309 transitions. [2024-11-07 01:48:05,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:48:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 13309 transitions. [2024-11-07 01:48:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:05,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:05,089 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:05,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:48:05,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:05,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:05,090 INFO L85 PathProgramCache]: Analyzing trace with hash 441043519, now seen corresponding path program 1 times [2024-11-07 01:48:05,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:05,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43391570] [2024-11-07 01:48:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:05,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43391570] [2024-11-07 01:48:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43391570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:05,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:48:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308947019] [2024-11-07 01:48:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:05,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:48:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:48:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:48:05,155 INFO L87 Difference]: Start difference. First operand 9176 states and 13309 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-07 01:48:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:07,148 INFO L93 Difference]: Finished difference Result 31433 states and 45311 transitions. [2024-11-07 01:48:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2024-11-07 01:48:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:07,203 INFO L225 Difference]: With dead ends: 31433 [2024-11-07 01:48:07,203 INFO L226 Difference]: Without dead ends: 22270 [2024-11-07 01:48:07,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:48:07,218 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 823 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:07,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 746 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22270 states. [2024-11-07 01:48:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22270 to 17850. [2024-11-07 01:48:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17850 states, 15613 states have (on average 1.4151027989495932) internal successors, (22094), 15742 states have internal predecessors, (22094), 1324 states have call successors, (1324), 784 states have call predecessors, (1324), 912 states have return successors, (2331), 1355 states have call predecessors, (2331), 1324 states have call successors, (2331) [2024-11-07 01:48:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17850 states to 17850 states and 25749 transitions. [2024-11-07 01:48:08,251 INFO L78 Accepts]: Start accepts. Automaton has 17850 states and 25749 transitions. Word has length 79 [2024-11-07 01:48:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:08,251 INFO L471 AbstractCegarLoop]: Abstraction has 17850 states and 25749 transitions. [2024-11-07 01:48:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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) [2024-11-07 01:48:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17850 states and 25749 transitions. [2024-11-07 01:48:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:08,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:08,255 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:08,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:48:08,255 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:08,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1492492608, now seen corresponding path program 1 times [2024-11-07 01:48:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:08,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552486907] [2024-11-07 01:48:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:08,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:08,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:08,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:08,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:08,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:08,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552486907] [2024-11-07 01:48:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552486907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:08,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:08,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:08,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760949502] [2024-11-07 01:48:08,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:08,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:08,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:08,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:08,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:08,327 INFO L87 Difference]: Start difference. First operand 17850 states and 25749 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:48:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:10,011 INFO L93 Difference]: Finished difference Result 40369 states and 58183 transitions. [2024-11-07 01:48:10,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:48:10,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2024-11-07 01:48:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:10,086 INFO L225 Difference]: With dead ends: 40369 [2024-11-07 01:48:10,086 INFO L226 Difference]: Without dead ends: 22532 [2024-11-07 01:48:10,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:48:10,121 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 208 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:10,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 682 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22532 states. [2024-11-07 01:48:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22532 to 18048. [2024-11-07 01:48:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18048 states, 15811 states have (on average 1.4057301878439061) internal successors, (22226), 15940 states have internal predecessors, (22226), 1324 states have call successors, (1324), 784 states have call predecessors, (1324), 912 states have return successors, (2331), 1355 states have call predecessors, (2331), 1324 states have call successors, (2331) [2024-11-07 01:48:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18048 states to 18048 states and 25881 transitions. [2024-11-07 01:48:11,574 INFO L78 Accepts]: Start accepts. Automaton has 18048 states and 25881 transitions. Word has length 79 [2024-11-07 01:48:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:11,575 INFO L471 AbstractCegarLoop]: Abstraction has 18048 states and 25881 transitions. [2024-11-07 01:48:11,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-07 01:48:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 18048 states and 25881 transitions. [2024-11-07 01:48:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:11,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:11,579 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:11,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:48:11,579 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:11,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2100874814, now seen corresponding path program 1 times [2024-11-07 01:48:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389703533] [2024-11-07 01:48:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:11,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:11,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:11,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389703533] [2024-11-07 01:48:11,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389703533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:11,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:11,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564217427] [2024-11-07 01:48:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:11,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:11,688 INFO L87 Difference]: Start difference. First operand 18048 states and 25881 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:12,887 INFO L93 Difference]: Finished difference Result 21912 states and 31122 transitions. [2024-11-07 01:48:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:48:12,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:48:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:12,933 INFO L225 Difference]: With dead ends: 21912 [2024-11-07 01:48:12,933 INFO L226 Difference]: Without dead ends: 12438 [2024-11-07 01:48:12,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:48:12,955 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 882 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:12,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 659 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12438 states. [2024-11-07 01:48:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12438 to 9740. [2024-11-07 01:48:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9740 states, 8515 states have (on average 1.3874339401056959) internal successors, (11814), 8580 states have internal predecessors, (11814), 732 states have call successors, (732), 428 states have call predecessors, (732), 492 states have return successors, (1071), 747 states have call predecessors, (1071), 732 states have call successors, (1071) [2024-11-07 01:48:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9740 states to 9740 states and 13617 transitions. [2024-11-07 01:48:13,516 INFO L78 Accepts]: Start accepts. Automaton has 9740 states and 13617 transitions. Word has length 79 [2024-11-07 01:48:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:13,516 INFO L471 AbstractCegarLoop]: Abstraction has 9740 states and 13617 transitions. [2024-11-07 01:48:13,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 9740 states and 13617 transitions. [2024-11-07 01:48:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:13,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:13,518 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:13,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:48:13,518 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:13,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2038835200, now seen corresponding path program 1 times [2024-11-07 01:48:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234971102] [2024-11-07 01:48:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:13,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234971102] [2024-11-07 01:48:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234971102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:13,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409732275] [2024-11-07 01:48:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:13,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:13,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:13,671 INFO L87 Difference]: Start difference. First operand 9740 states and 13617 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:14,625 INFO L93 Difference]: Finished difference Result 12500 states and 17430 transitions. [2024-11-07 01:48:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:48:14,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:48:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:14,648 INFO L225 Difference]: With dead ends: 12500 [2024-11-07 01:48:14,648 INFO L226 Difference]: Without dead ends: 6992 [2024-11-07 01:48:14,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:48:14,660 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 692 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:14,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 747 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2024-11-07 01:48:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 5398. [2024-11-07 01:48:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5398 states, 4713 states have (on average 1.3766178654784638) internal successors, (6488), 4746 states have internal predecessors, (6488), 414 states have call successors, (414), 238 states have call predecessors, (414), 270 states have return successors, (529), 421 states have call predecessors, (529), 414 states have call successors, (529) [2024-11-07 01:48:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 7431 transitions. [2024-11-07 01:48:14,978 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 7431 transitions. Word has length 79 [2024-11-07 01:48:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:14,979 INFO L471 AbstractCegarLoop]: Abstraction has 5398 states and 7431 transitions. [2024-11-07 01:48:14,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 7431 transitions. [2024-11-07 01:48:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:14,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:14,980 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:14,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:48:14,980 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:14,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1898286590, now seen corresponding path program 1 times [2024-11-07 01:48:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417199591] [2024-11-07 01:48:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:15,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417199591] [2024-11-07 01:48:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417199591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:15,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:15,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154908813] [2024-11-07 01:48:15,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:15,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:15,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:15,090 INFO L87 Difference]: Start difference. First operand 5398 states and 7431 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:15,917 INFO L93 Difference]: Finished difference Result 7608 states and 10530 transitions. [2024-11-07 01:48:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:48:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:48:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:15,932 INFO L225 Difference]: With dead ends: 7608 [2024-11-07 01:48:15,933 INFO L226 Difference]: Without dead ends: 4301 [2024-11-07 01:48:15,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:48:15,938 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 864 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:15,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 659 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2024-11-07 01:48:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 3257. [2024-11-07 01:48:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3257 states, 2842 states have (on average 1.3754398311048557) internal successors, (3909), 2859 states have internal predecessors, (3909), 255 states have call successors, (255), 143 states have call predecessors, (255), 159 states have return successors, (294), 258 states have call predecessors, (294), 255 states have call successors, (294) [2024-11-07 01:48:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 4458 transitions. [2024-11-07 01:48:16,150 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 4458 transitions. Word has length 79 [2024-11-07 01:48:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:16,150 INFO L471 AbstractCegarLoop]: Abstraction has 3257 states and 4458 transitions. [2024-11-07 01:48:16,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 4458 transitions. [2024-11-07 01:48:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:16,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:16,151 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:16,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:48:16,152 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:16,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2032300096, now seen corresponding path program 1 times [2024-11-07 01:48:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:16,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229651706] [2024-11-07 01:48:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:16,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:16,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229651706] [2024-11-07 01:48:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229651706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475162784] [2024-11-07 01:48:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:16,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:16,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:16,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:16,249 INFO L87 Difference]: Start difference. First operand 3257 states and 4458 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:17,181 INFO L93 Difference]: Finished difference Result 6823 states and 9365 transitions. [2024-11-07 01:48:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:48:17,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:48:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:17,196 INFO L225 Difference]: With dead ends: 6823 [2024-11-07 01:48:17,196 INFO L226 Difference]: Without dead ends: 4573 [2024-11-07 01:48:17,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:48:17,201 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 899 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:17,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 654 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2024-11-07 01:48:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 3237. [2024-11-07 01:48:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 2826 states have (on average 1.3690728945506017) internal successors, (3869), 2839 states have internal predecessors, (3869), 255 states have call successors, (255), 143 states have call predecessors, (255), 155 states have return successors, (276), 256 states have call predecessors, (276), 255 states have call successors, (276) [2024-11-07 01:48:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4400 transitions. [2024-11-07 01:48:17,388 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4400 transitions. Word has length 79 [2024-11-07 01:48:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:17,389 INFO L471 AbstractCegarLoop]: Abstraction has 3237 states and 4400 transitions. [2024-11-07 01:48:17,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4400 transitions. [2024-11-07 01:48:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:17,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:17,390 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:17,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:48:17,390 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:17,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1813445378, now seen corresponding path program 1 times [2024-11-07 01:48:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:17,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582092204] [2024-11-07 01:48:17,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:17,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:17,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582092204] [2024-11-07 01:48:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582092204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:17,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192566661] [2024-11-07 01:48:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:17,496 INFO L87 Difference]: Start difference. First operand 3237 states and 4400 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:18,623 INFO L93 Difference]: Finished difference Result 10644 states and 14307 transitions. [2024-11-07 01:48:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:48:18,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:48:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:18,644 INFO L225 Difference]: With dead ends: 10644 [2024-11-07 01:48:18,644 INFO L226 Difference]: Without dead ends: 7421 [2024-11-07 01:48:18,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:48:18,652 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 918 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:18,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 659 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:48:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7421 states. [2024-11-07 01:48:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7421 to 5309. [2024-11-07 01:48:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 4628 states have (on average 1.349827139152982) internal successors, (6247), 4665 states have internal predecessors, (6247), 407 states have call successors, (407), 237 states have call predecessors, (407), 273 states have return successors, (478), 410 states have call predecessors, (478), 407 states have call successors, (478) [2024-11-07 01:48:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 7132 transitions. [2024-11-07 01:48:18,986 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 7132 transitions. Word has length 79 [2024-11-07 01:48:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:18,986 INFO L471 AbstractCegarLoop]: Abstraction has 5309 states and 7132 transitions. [2024-11-07 01:48:18,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 7132 transitions. [2024-11-07 01:48:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:18,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:18,987 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:18,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:48:18,987 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:18,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:18,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1390743552, now seen corresponding path program 1 times [2024-11-07 01:48:18,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:18,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15499981] [2024-11-07 01:48:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:19,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15499981] [2024-11-07 01:48:19,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15499981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:19,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:19,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:48:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431013789] [2024-11-07 01:48:19,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:19,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:48:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:48:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:19,085 INFO L87 Difference]: Start difference. First operand 5309 states and 7132 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:20,032 INFO L93 Difference]: Finished difference Result 10343 states and 13856 transitions. [2024-11-07 01:48:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:48:20,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:48:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:20,053 INFO L225 Difference]: With dead ends: 10343 [2024-11-07 01:48:20,053 INFO L226 Difference]: Without dead ends: 7053 [2024-11-07 01:48:20,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:48:20,061 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 885 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:20,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 655 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7053 states. [2024-11-07 01:48:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7053 to 5229. [2024-11-07 01:48:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5229 states, 4564 states have (on average 1.3442156003505696) internal successors, (6135), 4585 states have internal predecessors, (6135), 407 states have call successors, (407), 237 states have call predecessors, (407), 257 states have return successors, (444), 408 states have call predecessors, (444), 407 states have call successors, (444) [2024-11-07 01:48:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 6986 transitions. [2024-11-07 01:48:20,385 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 6986 transitions. Word has length 79 [2024-11-07 01:48:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:20,385 INFO L471 AbstractCegarLoop]: Abstraction has 5229 states and 6986 transitions. [2024-11-07 01:48:20,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:48:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 6986 transitions. [2024-11-07 01:48:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:48:20,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:20,386 INFO L215 NwaCegarLoop]: 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] [2024-11-07 01:48:20,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 01:48:20,386 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:20,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2086575294, now seen corresponding path program 1 times [2024-11-07 01:48:20,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:20,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306165174] [2024-11-07 01:48:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:48:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306165174] [2024-11-07 01:48:20,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306165174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:20,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:20,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289910689] [2024-11-07 01:48:20,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:20,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:20,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:20,441 INFO L87 Difference]: Start difference. First operand 5229 states and 6986 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 01:48:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:21,352 INFO L93 Difference]: Finished difference Result 14042 states and 18859 transitions. [2024-11-07 01:48:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:48:21,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 79 [2024-11-07 01:48:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:21,379 INFO L225 Difference]: With dead ends: 14042 [2024-11-07 01:48:21,379 INFO L226 Difference]: Without dead ends: 8827 [2024-11-07 01:48:21,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:48:21,391 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 617 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:21,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 409 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:48:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8827 states. [2024-11-07 01:48:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8827 to 6921. [2024-11-07 01:48:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6921 states, 6048 states have (on average 1.3338293650793651) internal successors, (8067), 6097 states have internal predecessors, (8067), 531 states have call successors, (531), 317 states have call predecessors, (531), 341 states have return successors, (572), 508 states have call predecessors, (572), 531 states have call successors, (572) [2024-11-07 01:48:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 9170 transitions. [2024-11-07 01:48:21,804 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 9170 transitions. Word has length 79 [2024-11-07 01:48:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:21,805 INFO L471 AbstractCegarLoop]: Abstraction has 6921 states and 9170 transitions. [2024-11-07 01:48:21,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 01:48:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 9170 transitions. [2024-11-07 01:48:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 01:48:21,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:21,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:21,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 01:48:21,809 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 602038727, now seen corresponding path program 1 times [2024-11-07 01:48:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671486662] [2024-11-07 01:48:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:48:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 01:48:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-07 01:48:21,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671486662] [2024-11-07 01:48:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671486662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:21,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503107883] [2024-11-07 01:48:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:21,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:21,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:21,960 INFO L87 Difference]: Start difference. First operand 6921 states and 9170 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:23,528 INFO L93 Difference]: Finished difference Result 24464 states and 32606 transitions. [2024-11-07 01:48:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:23,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 129 [2024-11-07 01:48:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:23,576 INFO L225 Difference]: With dead ends: 24464 [2024-11-07 01:48:23,577 INFO L226 Difference]: Without dead ends: 17559 [2024-11-07 01:48:23,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:48:23,594 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 758 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:23,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 596 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17559 states. [2024-11-07 01:48:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17559 to 14145. [2024-11-07 01:48:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14145 states, 12357 states have (on average 1.3149631787650724) internal successors, (16249), 12487 states have internal predecessors, (16249), 1044 states have call successors, (1044), 633 states have call predecessors, (1044), 743 states have return successors, (1396), 1028 states have call predecessors, (1396), 1044 states have call successors, (1396) [2024-11-07 01:48:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 18689 transitions. [2024-11-07 01:48:24,525 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 18689 transitions. Word has length 129 [2024-11-07 01:48:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:24,526 INFO L471 AbstractCegarLoop]: Abstraction has 14145 states and 18689 transitions. [2024-11-07 01:48:24,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 5 states have internal predecessors, (84), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 18689 transitions. [2024-11-07 01:48:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 01:48:24,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:24,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:24,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 01:48:24,532 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash -490596475, now seen corresponding path program 1 times [2024-11-07 01:48:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789567461] [2024-11-07 01:48:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:48:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 01:48:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-07 01:48:24,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789567461] [2024-11-07 01:48:24,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789567461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:24,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:24,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55710899] [2024-11-07 01:48:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:24,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:24,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:24,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:24,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:24,586 INFO L87 Difference]: Start difference. First operand 14145 states and 18689 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:25,773 INFO L93 Difference]: Finished difference Result 27782 states and 36685 transitions. [2024-11-07 01:48:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:48:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 129 [2024-11-07 01:48:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:25,818 INFO L225 Difference]: With dead ends: 27782 [2024-11-07 01:48:25,818 INFO L226 Difference]: Without dead ends: 13653 [2024-11-07 01:48:25,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:25,839 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 471 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:25,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 307 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:48:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13653 states. [2024-11-07 01:48:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13653 to 10907. [2024-11-07 01:48:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10907 states, 9548 states have (on average 1.311897779639715) internal successors, (12526), 9653 states have internal predecessors, (12526), 785 states have call successors, (785), 475 states have call predecessors, (785), 573 states have return successors, (1044), 780 states have call predecessors, (1044), 785 states have call successors, (1044) [2024-11-07 01:48:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10907 states to 10907 states and 14355 transitions. [2024-11-07 01:48:26,700 INFO L78 Accepts]: Start accepts. Automaton has 10907 states and 14355 transitions. Word has length 129 [2024-11-07 01:48:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 10907 states and 14355 transitions. [2024-11-07 01:48:26,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 10907 states and 14355 transitions. [2024-11-07 01:48:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 01:48:26,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:26,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:26,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 01:48:26,706 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:26,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1387524436, now seen corresponding path program 1 times [2024-11-07 01:48:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:26,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512465789] [2024-11-07 01:48:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:48:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 01:48:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-07 01:48:26,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:26,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512465789] [2024-11-07 01:48:26,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512465789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:26,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:26,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099120523] [2024-11-07 01:48:26,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:26,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:26,888 INFO L87 Difference]: Start difference. First operand 10907 states and 14355 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:29,468 INFO L93 Difference]: Finished difference Result 38442 states and 50662 transitions. [2024-11-07 01:48:29,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:29,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 131 [2024-11-07 01:48:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:29,563 INFO L225 Difference]: With dead ends: 38442 [2024-11-07 01:48:29,563 INFO L226 Difference]: Without dead ends: 27551 [2024-11-07 01:48:29,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:48:29,587 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1057 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:29,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 406 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:29,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27551 states. [2024-11-07 01:48:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27551 to 22687. [2024-11-07 01:48:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22687 states, 19793 states have (on average 1.2935381195372102) internal successors, (25603), 20130 states have internal predecessors, (25603), 1511 states have call successors, (1511), 945 states have call predecessors, (1511), 1382 states have return successors, (2549), 1613 states have call predecessors, (2549), 1511 states have call successors, (2549) [2024-11-07 01:48:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22687 states to 22687 states and 29663 transitions. [2024-11-07 01:48:31,298 INFO L78 Accepts]: Start accepts. Automaton has 22687 states and 29663 transitions. Word has length 131 [2024-11-07 01:48:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:31,299 INFO L471 AbstractCegarLoop]: Abstraction has 22687 states and 29663 transitions. [2024-11-07 01:48:31,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 22687 states and 29663 transitions. [2024-11-07 01:48:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 01:48:31,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:31,310 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:31,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 01:48:31,310 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:31,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:31,311 INFO L85 PathProgramCache]: Analyzing trace with hash 335693767, now seen corresponding path program 1 times [2024-11-07 01:48:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247157299] [2024-11-07 01:48:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:48:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 01:48:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-07 01:48:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:31,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247157299] [2024-11-07 01:48:31,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247157299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:31,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:31,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611263415] [2024-11-07 01:48:31,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:31,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:31,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:31,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:31,483 INFO L87 Difference]: Start difference. First operand 22687 states and 29663 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:36,409 INFO L93 Difference]: Finished difference Result 78028 states and 102332 transitions. [2024-11-07 01:48:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:48:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 133 [2024-11-07 01:48:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:36,578 INFO L225 Difference]: With dead ends: 78028 [2024-11-07 01:48:36,578 INFO L226 Difference]: Without dead ends: 55357 [2024-11-07 01:48:36,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:48:36,620 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 800 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:36,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 622 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:48:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55357 states. [2024-11-07 01:48:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55357 to 45063. [2024-11-07 01:48:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45063 states, 39038 states have (on average 1.285926533121574) internal successors, (50200), 39904 states have internal predecessors, (50200), 2934 states have call successors, (2934), 1875 states have call predecessors, (2934), 3090 states have return successors, (5727), 3287 states have call predecessors, (5727), 2934 states have call successors, (5727) [2024-11-07 01:48:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45063 states to 45063 states and 58861 transitions. [2024-11-07 01:48:40,320 INFO L78 Accepts]: Start accepts. Automaton has 45063 states and 58861 transitions. Word has length 133 [2024-11-07 01:48:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:40,321 INFO L471 AbstractCegarLoop]: Abstraction has 45063 states and 58861 transitions. [2024-11-07 01:48:40,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 45063 states and 58861 transitions. [2024-11-07 01:48:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 01:48:40,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:40,336 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:40,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 01:48:40,336 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:40,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1714715131, now seen corresponding path program 1 times [2024-11-07 01:48:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844234464] [2024-11-07 01:48:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:48:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 01:48:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-07 01:48:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:40,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844234464] [2024-11-07 01:48:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844234464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:40,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:40,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:48:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711189063] [2024-11-07 01:48:40,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:40,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:48:40,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:40,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:48:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:48:40,391 INFO L87 Difference]: Start difference. First operand 45063 states and 58861 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:44,594 INFO L93 Difference]: Finished difference Result 87439 states and 114624 transitions. [2024-11-07 01:48:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:48:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 133 [2024-11-07 01:48:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:44,752 INFO L225 Difference]: With dead ends: 87439 [2024-11-07 01:48:44,752 INFO L226 Difference]: Without dead ends: 42392 [2024-11-07 01:48:44,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:48:44,819 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 468 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:44,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 305 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:48:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42392 states. [2024-11-07 01:48:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42392 to 34652. [2024-11-07 01:48:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34652 states, 30015 states have (on average 1.289488589038814) internal successors, (38704), 30712 states have internal predecessors, (38704), 2220 states have call successors, (2220), 1410 states have call predecessors, (2220), 2416 states have return successors, (4503), 2531 states have call predecessors, (4503), 2220 states have call successors, (4503) [2024-11-07 01:48:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 45427 transitions. [2024-11-07 01:48:48,035 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 45427 transitions. Word has length 133 [2024-11-07 01:48:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:48:48,035 INFO L471 AbstractCegarLoop]: Abstraction has 34652 states and 45427 transitions. [2024-11-07 01:48:48,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:48:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 45427 transitions. [2024-11-07 01:48:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:48:48,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:48:48,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:48:48,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 01:48:48,045 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:48:48,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:48:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1201892844, now seen corresponding path program 1 times [2024-11-07 01:48:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:48:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407637894] [2024-11-07 01:48:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:48:48,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:48:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:48:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:48:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:48:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:48:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:48:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:48:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:48:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 01:48:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:48:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 01:48:48,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:48:48,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407637894] [2024-11-07 01:48:48,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407637894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:48:48,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:48:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:48:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430084081] [2024-11-07 01:48:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:48:48,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:48:48,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:48:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:48:48,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:48:48,117 INFO L87 Difference]: Start difference. First operand 34652 states and 45427 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:48:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:48:56,210 INFO L93 Difference]: Finished difference Result 110375 states and 147729 transitions. [2024-11-07 01:48:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 01:48:56,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 135 [2024-11-07 01:48:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:48:56,422 INFO L225 Difference]: With dead ends: 110375 [2024-11-07 01:48:56,422 INFO L226 Difference]: Without dead ends: 61874 [2024-11-07 01:48:56,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-07 01:48:56,482 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 1964 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:48:56,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1978 Valid, 887 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:48:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61874 states. [2024-11-07 01:49:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61874 to 54350. [2024-11-07 01:49:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54350 states, 47393 states have (on average 1.2747241153756883) internal successors, (60413), 48492 states have internal predecessors, (60413), 3188 states have call successors, (3188), 2084 states have call predecessors, (3188), 3768 states have return successors, (7500), 3775 states have call predecessors, (7500), 3188 states have call successors, (7500) [2024-11-07 01:49:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54350 states to 54350 states and 71101 transitions. [2024-11-07 01:49:01,047 INFO L78 Accepts]: Start accepts. Automaton has 54350 states and 71101 transitions. Word has length 135 [2024-11-07 01:49:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 54350 states and 71101 transitions. [2024-11-07 01:49:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-07 01:49:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 54350 states and 71101 transitions. [2024-11-07 01:49:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 01:49:01,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:01,077 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:49:01,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 01:49:01,077 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:01,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1779072075, now seen corresponding path program 1 times [2024-11-07 01:49:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:01,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076110057] [2024-11-07 01:49:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:49:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:49:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:49:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:49:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:49:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 01:49:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:49:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 01:49:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 01:49:01,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:01,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076110057] [2024-11-07 01:49:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076110057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:01,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:01,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:49:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663015084] [2024-11-07 01:49:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:01,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:49:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:49:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:49:01,142 INFO L87 Difference]: Start difference. First operand 54350 states and 71101 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)