./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.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/Problem05_label49+token_ring.07.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', 'a0d6ced7e0ff387d58cf8725410ee88dbee5b176eb503e82e37c165076b7e65d'] 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/Problem05_label49+token_ring.07.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 a0d6ced7e0ff387d58cf8725410ee88dbee5b176eb503e82e37c165076b7e65d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:10:15,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:10:15,407 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:10:15,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:10:15,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:10:15,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:10:15,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:10:15,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:10:15,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:10:15,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:10:15,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:10:15,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:10:15,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:10:15,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:10:15,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:10:15,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:10:15,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:10:15,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:10:15,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:10:15,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:10:15,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:10:15,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:10:15,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:10:15,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:10:15,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:10:15,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:10:15,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:10:15,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:10:15,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:10:15,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:10:15,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:10:15,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:10:15,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:15,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:10:15,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:10:15,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:10:15,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:10:15,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:10:15,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:10:15,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:10:15,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:10:15,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:10:15,455 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 -> a0d6ced7e0ff387d58cf8725410ee88dbee5b176eb503e82e37c165076b7e65d [2024-11-07 01:10:15,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:10:15,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:10:15,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:10:15,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:10:15,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:10:15,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-2.c [2024-11-07 01:10:17,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:10:17,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:10:17,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-2.c [2024-11-07 01:10:17,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b40975498/bb6be8b7a22543948f2dc522a7877961/FLAG35b010b74 [2024-11-07 01:10:17,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b40975498/bb6be8b7a22543948f2dc522a7877961 [2024-11-07 01:10:17,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:10:17,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:10:17,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:17,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:10:17,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:10:17,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:17" (1/1) ... [2024-11-07 01:10:17,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca0284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:17, skipping insertion in model container [2024-11-07 01:10:17,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:17" (1/1) ... [2024-11-07 01:10:18,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:10:19,555 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/Problem05_label49+token_ring.07.cil-2.c[380593,380606] [2024-11-07 01:10:19,585 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/Problem05_label49+token_ring.07.cil-2.c[383339,383352] [2024-11-07 01:10:19,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:19,775 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:10:20,461 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/Problem05_label49+token_ring.07.cil-2.c[380593,380606] [2024-11-07 01:10:20,474 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/Problem05_label49+token_ring.07.cil-2.c[383339,383352] [2024-11-07 01:10:20,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:20,603 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:10:20,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20 WrapperNode [2024-11-07 01:10:20,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:20,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:20,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:10:20,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:10:20,613 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:10:20" (1/1) ... [2024-11-07 01:10:20,677 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:10:20" (1/1) ... [2024-11-07 01:10:21,094 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12939 [2024-11-07 01:10:21,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:21,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:10:21,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:10:21,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:10:21,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,264 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:10:21,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:10:21,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:10:21,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:10:21,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:10:21,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (1/1) ... [2024-11-07 01:10:21,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:21,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:10:21,681 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:10:21,690 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:10:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:10:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:10:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:10:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:10:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:10:21,710 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:10:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:10:21,710 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 01:10:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 01:10:21,710 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:10:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:10:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:10:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:10:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:10:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:10:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:10:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:10:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:10:21,854 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:10:21,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:10:29,966 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2024-11-07 01:10:29,967 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:10:30,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:10:30,027 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-07 01:10:30,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:30 BoogieIcfgContainer [2024-11-07 01:10:30,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:10:30,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:10:30,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:10:30,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:10:30,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:10:17" (1/3) ... [2024-11-07 01:10:30,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b795ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:30, skipping insertion in model container [2024-11-07 01:10:30,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:20" (2/3) ... [2024-11-07 01:10:30,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b795ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:30, skipping insertion in model container [2024-11-07 01:10:30,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:30" (3/3) ... [2024-11-07 01:10:30,039 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.07.cil-2.c [2024-11-07 01:10:30,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:10:30,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:10:30,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:10:30,184 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;@1a03d371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:10:30,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:10:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 2423 states have (on average 1.8472967395790343) internal successors, (4476), 2428 states have internal predecessors, (4476), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 01:10:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:30,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:30,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:30,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:30,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash -165382437, now seen corresponding path program 1 times [2024-11-07 01:10:30,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:30,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465175760] [2024-11-07 01:10:30,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:30,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:30,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:30,719 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:10:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:30,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465175760] [2024-11-07 01:10:30,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465175760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:30,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:30,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:10:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366215318] [2024-11-07 01:10:30,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:30,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:10:30,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:30,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:10:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:10:30,754 INFO L87 Difference]: Start difference. First operand has 2456 states, 2423 states have (on average 1.8472967395790343) internal successors, (4476), 2428 states have internal predecessors, (4476), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:32,001 INFO L93 Difference]: Finished difference Result 4986 states and 9171 transitions. [2024-11-07 01:10:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:10:32,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:32,035 INFO L225 Difference]: With dead ends: 4986 [2024-11-07 01:10:32,035 INFO L226 Difference]: Without dead ends: 2475 [2024-11-07 01:10:32,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:10:32,051 INFO L432 NwaCegarLoop]: 4279 mSDtfsCounter, 679 mSDsluCounter, 12369 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 16648 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:32,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 16648 Invalid, 702 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:10:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2024-11-07 01:10:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2388. [2024-11-07 01:10:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2357 states have (on average 1.8341111582520153) internal successors, (4323), 2360 states have internal predecessors, (4323), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 01:10:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4367 transitions. [2024-11-07 01:10:32,224 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4367 transitions. Word has length 124 [2024-11-07 01:10:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:32,224 INFO L471 AbstractCegarLoop]: Abstraction has 2388 states and 4367 transitions. [2024-11-07 01:10:32,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4367 transitions. [2024-11-07 01:10:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:32,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:32,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:32,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:10:32,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:32,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash 873202137, now seen corresponding path program 1 times [2024-11-07 01:10:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763128636] [2024-11-07 01:10:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:32,580 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:10:32,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:32,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763128636] [2024-11-07 01:10:32,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763128636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:32,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:32,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:10:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133917264] [2024-11-07 01:10:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:32,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:10:32,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:10:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:10:32,586 INFO L87 Difference]: Start difference. First operand 2388 states and 4367 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:34,452 INFO L93 Difference]: Finished difference Result 3074 states and 5454 transitions. [2024-11-07 01:10:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:10:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:34,469 INFO L225 Difference]: With dead ends: 3074 [2024-11-07 01:10:34,470 INFO L226 Difference]: Without dead ends: 2822 [2024-11-07 01:10:34,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:10:34,475 INFO L432 NwaCegarLoop]: 4190 mSDtfsCounter, 4967 mSDsluCounter, 12573 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4981 SdHoareTripleChecker+Valid, 16763 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:34,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4981 Valid, 16763 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:10:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2024-11-07 01:10:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2647. [2024-11-07 01:10:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2593 states have (on average 1.8094870806016197) internal successors, (4692), 2597 states have internal predecessors, (4692), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-11-07 01:10:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 4771 transitions. [2024-11-07 01:10:34,579 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 4771 transitions. Word has length 124 [2024-11-07 01:10:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:34,580 INFO L471 AbstractCegarLoop]: Abstraction has 2647 states and 4771 transitions. [2024-11-07 01:10:34,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 4771 transitions. [2024-11-07 01:10:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:34,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:34,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:34,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:10:34,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:34,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -144446251, now seen corresponding path program 1 times [2024-11-07 01:10:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:34,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74057950] [2024-11-07 01:10:34,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:34,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:34,898 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:10:34,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:34,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74057950] [2024-11-07 01:10:34,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74057950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:34,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:34,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612157194] [2024-11-07 01:10:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:34,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:34,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:34,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:34,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:34,902 INFO L87 Difference]: Start difference. First operand 2647 states and 4771 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:37,467 INFO L93 Difference]: Finished difference Result 3688 states and 6419 transitions. [2024-11-07 01:10:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:37,485 INFO L225 Difference]: With dead ends: 3688 [2024-11-07 01:10:37,485 INFO L226 Difference]: Without dead ends: 3177 [2024-11-07 01:10:37,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:37,490 INFO L432 NwaCegarLoop]: 4367 mSDtfsCounter, 4978 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4992 SdHoareTripleChecker+Valid, 21586 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:37,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4992 Valid, 21586 Invalid, 2345 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:10:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2024-11-07 01:10:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2889. [2024-11-07 01:10:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2812 states have (on average 1.7876955903271692) internal successors, (5027), 2817 states have internal predecessors, (5027), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-11-07 01:10:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5140 transitions. [2024-11-07 01:10:37,592 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5140 transitions. Word has length 124 [2024-11-07 01:10:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:37,592 INFO L471 AbstractCegarLoop]: Abstraction has 2889 states and 5140 transitions. [2024-11-07 01:10:37,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5140 transitions. [2024-11-07 01:10:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:37,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:37,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:37,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:10:37,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:37,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash -26004777, now seen corresponding path program 1 times [2024-11-07 01:10:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632390750] [2024-11-07 01:10:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,838 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:10:37,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632390750] [2024-11-07 01:10:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632390750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:37,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632744514] [2024-11-07 01:10:37,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:37,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:37,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:37,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:37,840 INFO L87 Difference]: Start difference. First operand 2889 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:39,764 INFO L93 Difference]: Finished difference Result 4593 states and 7832 transitions. [2024-11-07 01:10:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:39,782 INFO L225 Difference]: With dead ends: 4593 [2024-11-07 01:10:39,782 INFO L226 Difference]: Without dead ends: 3840 [2024-11-07 01:10:39,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:39,787 INFO L432 NwaCegarLoop]: 4365 mSDtfsCounter, 4976 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4990 SdHoareTripleChecker+Valid, 21584 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:39,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4990 Valid, 21584 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:10:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2024-11-07 01:10:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3374. [2024-11-07 01:10:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3374 states, 3251 states have (on average 1.7526914795447555) internal successors, (5698), 3258 states have internal predecessors, (5698), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-11-07 01:10:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 5883 transitions. [2024-11-07 01:10:39,905 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 5883 transitions. Word has length 124 [2024-11-07 01:10:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:39,905 INFO L471 AbstractCegarLoop]: Abstraction has 3374 states and 5883 transitions. [2024-11-07 01:10:39,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 5883 transitions. [2024-11-07 01:10:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:39,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:39,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:10:39,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:39,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1363289237, now seen corresponding path program 1 times [2024-11-07 01:10:39,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192487825] [2024-11-07 01:10:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:40,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:40,161 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:10:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192487825] [2024-11-07 01:10:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192487825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22784471] [2024-11-07 01:10:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:40,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:40,163 INFO L87 Difference]: Start difference. First operand 3374 states and 5883 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:42,042 INFO L93 Difference]: Finished difference Result 6338 states and 10543 transitions. [2024-11-07 01:10:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:42,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:42,062 INFO L225 Difference]: With dead ends: 6338 [2024-11-07 01:10:42,062 INFO L226 Difference]: Without dead ends: 5100 [2024-11-07 01:10:42,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:42,069 INFO L432 NwaCegarLoop]: 4365 mSDtfsCounter, 4972 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4986 SdHoareTripleChecker+Valid, 21584 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:42,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4986 Valid, 21584 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:10:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2024-11-07 01:10:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4345. [2024-11-07 01:10:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4130 states have (on average 1.7046004842615012) internal successors, (7040), 4141 states have internal predecessors, (7040), 151 states have call successors, (151), 55 states have call predecessors, (151), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-11-07 01:10:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 7375 transitions. [2024-11-07 01:10:42,235 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 7375 transitions. Word has length 124 [2024-11-07 01:10:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:42,236 INFO L471 AbstractCegarLoop]: Abstraction has 4345 states and 7375 transitions. [2024-11-07 01:10:42,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 7375 transitions. [2024-11-07 01:10:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:42,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:42,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:10:42,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:42,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash -670104809, now seen corresponding path program 1 times [2024-11-07 01:10:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140466782] [2024-11-07 01:10:42,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,444 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:10:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140466782] [2024-11-07 01:10:42,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140466782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:42,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:42,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140029783] [2024-11-07 01:10:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:42,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:42,446 INFO L87 Difference]: Start difference. First operand 4345 states and 7375 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:44,429 INFO L93 Difference]: Finished difference Result 9827 states and 15981 transitions. [2024-11-07 01:10:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:44,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:44,468 INFO L225 Difference]: With dead ends: 9827 [2024-11-07 01:10:44,468 INFO L226 Difference]: Without dead ends: 7618 [2024-11-07 01:10:44,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:44,478 INFO L432 NwaCegarLoop]: 4365 mSDtfsCounter, 4968 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4982 SdHoareTripleChecker+Valid, 21584 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:44,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4982 Valid, 21584 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:10:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7618 states. [2024-11-07 01:10:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7618 to 6292. [2024-11-07 01:10:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6292 states, 5893 states have (on average 1.6511114882063465) internal successors, (9730), 5912 states have internal predecessors, (9730), 279 states have call successors, (279), 103 states have call predecessors, (279), 118 states have return successors, (374), 292 states have call predecessors, (374), 277 states have call successors, (374) [2024-11-07 01:10:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6292 states to 6292 states and 10383 transitions. [2024-11-07 01:10:44,750 INFO L78 Accepts]: Start accepts. Automaton has 6292 states and 10383 transitions. Word has length 124 [2024-11-07 01:10:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:44,751 INFO L471 AbstractCegarLoop]: Abstraction has 6292 states and 10383 transitions. [2024-11-07 01:10:44,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6292 states and 10383 transitions. [2024-11-07 01:10:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:44,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:44,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:44,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:10:44,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1758153813, now seen corresponding path program 1 times [2024-11-07 01:10:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078930327] [2024-11-07 01:10:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:44,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:44,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:44,938 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:10:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078930327] [2024-11-07 01:10:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078930327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:44,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:44,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048277643] [2024-11-07 01:10:44,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:44,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:44,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:44,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:44,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:44,940 INFO L87 Difference]: Start difference. First operand 6292 states and 10383 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:47,306 INFO L93 Difference]: Finished difference Result 16804 states and 26915 transitions. [2024-11-07 01:10:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:47,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:47,362 INFO L225 Difference]: With dead ends: 16804 [2024-11-07 01:10:47,362 INFO L226 Difference]: Without dead ends: 12648 [2024-11-07 01:10:47,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:47,466 INFO L432 NwaCegarLoop]: 4365 mSDtfsCounter, 4970 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 21584 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:47,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4984 Valid, 21584 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:10:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12648 states. [2024-11-07 01:10:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12648 to 10199. [2024-11-07 01:10:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 9432 states have (on average 1.6039016115351994) internal successors, (15128), 9467 states have internal predecessors, (15128), 535 states have call successors, (535), 199 states have call predecessors, (535), 230 states have return successors, (808), 564 states have call predecessors, (808), 533 states have call successors, (808) [2024-11-07 01:10:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 16471 transitions. [2024-11-07 01:10:47,867 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 16471 transitions. Word has length 124 [2024-11-07 01:10:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:47,867 INFO L471 AbstractCegarLoop]: Abstraction has 10199 states and 16471 transitions. [2024-11-07 01:10:47,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 16471 transitions. [2024-11-07 01:10:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:47,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:47,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:47,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:10:47,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:47,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash 451011415, now seen corresponding path program 1 times [2024-11-07 01:10:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927662043] [2024-11-07 01:10:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:47,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:48,070 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:10:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927662043] [2024-11-07 01:10:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927662043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659211274] [2024-11-07 01:10:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:48,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:48,072 INFO L87 Difference]: Start difference. First operand 10199 states and 16471 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:49,410 INFO L93 Difference]: Finished difference Result 20804 states and 33396 transitions. [2024-11-07 01:10:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:10:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:49,465 INFO L225 Difference]: With dead ends: 20804 [2024-11-07 01:10:49,465 INFO L226 Difference]: Without dead ends: 12741 [2024-11-07 01:10:49,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:10:49,492 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4818 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4833 SdHoareTripleChecker+Valid, 16582 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:49,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4833 Valid, 16582 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:10:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2024-11-07 01:10:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10199. [2024-11-07 01:10:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 9432 states have (on average 1.6004028837998303) internal successors, (15095), 9467 states have internal predecessors, (15095), 535 states have call successors, (535), 199 states have call predecessors, (535), 230 states have return successors, (808), 564 states have call predecessors, (808), 533 states have call successors, (808) [2024-11-07 01:10:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 16438 transitions. [2024-11-07 01:10:50,041 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 16438 transitions. Word has length 124 [2024-11-07 01:10:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:50,041 INFO L471 AbstractCegarLoop]: Abstraction has 10199 states and 16438 transitions. [2024-11-07 01:10:50,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 16438 transitions. [2024-11-07 01:10:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:50,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:50,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:10:50,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:50,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1482052313, now seen corresponding path program 1 times [2024-11-07 01:10:50,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:50,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207902914] [2024-11-07 01:10:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:50,242 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:10:50,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:50,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207902914] [2024-11-07 01:10:50,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207902914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:50,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:50,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:50,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992078488] [2024-11-07 01:10:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:50,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:50,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:50,243 INFO L87 Difference]: Start difference. First operand 10199 states and 16438 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:53,253 INFO L93 Difference]: Finished difference Result 34116 states and 53867 transitions. [2024-11-07 01:10:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:10:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:53,362 INFO L225 Difference]: With dead ends: 34116 [2024-11-07 01:10:53,362 INFO L226 Difference]: Without dead ends: 26053 [2024-11-07 01:10:53,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:10:53,403 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5250 mSDsluCounter, 17211 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5272 SdHoareTripleChecker+Valid, 21574 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:53,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5272 Valid, 21574 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:10:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26053 states. [2024-11-07 01:10:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26053 to 18012. [2024-11-07 01:10:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18012 states, 16541 states have (on average 1.568043044555952) internal successors, (25937), 16608 states have internal predecessors, (25937), 1015 states have call successors, (1015), 391 states have call predecessors, (1015), 454 states have return successors, (1806), 1076 states have call predecessors, (1806), 1013 states have call successors, (1806) [2024-11-07 01:10:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18012 states to 18012 states and 28758 transitions. [2024-11-07 01:10:54,342 INFO L78 Accepts]: Start accepts. Automaton has 18012 states and 28758 transitions. Word has length 124 [2024-11-07 01:10:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:54,343 INFO L471 AbstractCegarLoop]: Abstraction has 18012 states and 28758 transitions. [2024-11-07 01:10:54,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 18012 states and 28758 transitions. [2024-11-07 01:10:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:10:54,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:54,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:54,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:10:54,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:54,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:54,354 INFO L85 PathProgramCache]: Analyzing trace with hash -424350953, now seen corresponding path program 1 times [2024-11-07 01:10:54,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:54,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975925584] [2024-11-07 01:10:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:54,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:10:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:10:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:54,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:10:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:54,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:10:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:54,545 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:10:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975925584] [2024-11-07 01:10:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975925584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:54,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156025691] [2024-11-07 01:10:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:54,547 INFO L87 Difference]: Start difference. First operand 18012 states and 28758 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:58,160 INFO L93 Difference]: Finished difference Result 64395 states and 101985 transitions. [2024-11-07 01:10:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:10:58,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:10:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:58,341 INFO L225 Difference]: With dead ends: 64395 [2024-11-07 01:10:58,341 INFO L226 Difference]: Without dead ends: 48519 [2024-11-07 01:10:58,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:10:58,389 INFO L432 NwaCegarLoop]: 4362 mSDtfsCounter, 5020 mSDsluCounter, 17208 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5033 SdHoareTripleChecker+Valid, 21570 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:58,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5033 Valid, 21570 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:10:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48519 states. [2024-11-07 01:11:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48519 to 32961. [2024-11-07 01:11:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32961 states, 30114 states have (on average 1.5438334329547718) internal successors, (46491), 30245 states have internal predecessors, (46491), 1943 states have call successors, (1943), 775 states have call predecessors, (1943), 902 states have return successors, (4256), 2068 states have call predecessors, (4256), 1941 states have call successors, (4256) [2024-11-07 01:11:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32961 states to 32961 states and 52690 transitions. [2024-11-07 01:11:00,523 INFO L78 Accepts]: Start accepts. Automaton has 32961 states and 52690 transitions. Word has length 124 [2024-11-07 01:11:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:00,524 INFO L471 AbstractCegarLoop]: Abstraction has 32961 states and 52690 transitions. [2024-11-07 01:11:00,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 32961 states and 52690 transitions. [2024-11-07 01:11:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:11:00,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:00,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:00,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:11:00,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1176720153, now seen corresponding path program 1 times [2024-11-07 01:11:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524011342] [2024-11-07 01:11:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:11:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:11:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:11:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:11:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:00,731 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:11:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524011342] [2024-11-07 01:11:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524011342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:00,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:00,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279654699] [2024-11-07 01:11:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:00,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:00,734 INFO L87 Difference]: Start difference. First operand 32961 states and 52690 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:06,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:06,233 INFO L93 Difference]: Finished difference Result 121846 states and 194751 transitions. [2024-11-07 01:11:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:11:06,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:11:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:06,679 INFO L225 Difference]: With dead ends: 121846 [2024-11-07 01:11:06,679 INFO L226 Difference]: Without dead ends: 91021 [2024-11-07 01:11:06,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:11:06,787 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5170 mSDsluCounter, 17211 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5192 SdHoareTripleChecker+Valid, 21574 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:06,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5192 Valid, 21574 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:11:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91021 states. [2024-11-07 01:11:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91021 to 63434. [2024-11-07 01:11:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63434 states, 57899 states have (on average 1.533929774262077) internal successors, (88813), 58158 states have internal predecessors, (88813), 3735 states have call successors, (3735), 1543 states have call predecessors, (3735), 1798 states have return successors, (10550), 3988 states have call predecessors, (10550), 3733 states have call successors, (10550) [2024-11-07 01:11:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63434 states to 63434 states and 103098 transitions. [2024-11-07 01:11:10,568 INFO L78 Accepts]: Start accepts. Automaton has 63434 states and 103098 transitions. Word has length 124 [2024-11-07 01:11:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:10,569 INFO L471 AbstractCegarLoop]: Abstraction has 63434 states and 103098 transitions. [2024-11-07 01:11:10,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 63434 states and 103098 transitions. [2024-11-07 01:11:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:11:10,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:10,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:10,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:11:10,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:10,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 119988951, now seen corresponding path program 1 times [2024-11-07 01:11:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636648959] [2024-11-07 01:11:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:11:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:11:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:10,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:11:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:10,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:11:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:10,765 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:11:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636648959] [2024-11-07 01:11:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636648959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818626317] [2024-11-07 01:11:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:10,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:10,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:10,767 INFO L87 Difference]: Start difference. First operand 63434 states and 103098 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:11:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:20,134 INFO L93 Difference]: Finished difference Result 236173 states and 385669 transitions. [2024-11-07 01:11:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:11:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:11:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:20,975 INFO L225 Difference]: With dead ends: 236173 [2024-11-07 01:11:20,975 INFO L226 Difference]: Without dead ends: 174875 [2024-11-07 01:11:21,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:11:21,124 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5130 mSDsluCounter, 17211 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5152 SdHoareTripleChecker+Valid, 21574 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:21,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5152 Valid, 21574 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:11:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174875 states.