./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --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/uthash-2.0.2/uthash_SFH_test6-1.i', '-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', '7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3'] 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/uthash-2.0.2/uthash_SFH_test6-1.i -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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:11:46,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:11:46,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 15:11:46,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:11:46,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:11:46,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:11:46,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:11:46,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:11:46,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 15:11:46,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:11:46,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:11:46,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:11:46,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:11:46,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 15:11:46,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:11:46,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:11:46,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:11:46,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:11:46,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:11:46,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:11:46,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:11:46,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:11:46,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:11:46,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:11:46,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:11:46,529 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2024-11-07 15:11:46,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:11:46,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:11:46,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:11:46,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:11:46,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:11:46,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-07 15:11:47,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:11:48,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:11:48,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-07 15:11:48,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8e60533c/a17e860a756b4e79af83f5d8bbb0a621/FLAG4191ca490 [2024-11-07 15:11:48,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8e60533c/a17e860a756b4e79af83f5d8bbb0a621 [2024-11-07 15:11:48,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:11:48,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:11:48,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:11:48,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:11:48,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:11:48,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:11:48" (1/1) ... [2024-11-07 15:11:48,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff196fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:48, skipping insertion in model container [2024-11-07 15:11:48,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:11:48" (1/1) ... [2024-11-07 15:11:48,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:11:48,852 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/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2024-11-07 15:11:48,865 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/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2024-11-07 15:11:48,927 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/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2024-11-07 15:11:48,928 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/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2024-11-07 15:11:48,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:11:48,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:11:48,974 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/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2024-11-07 15:11:48,976 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/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2024-11-07 15:11:49,016 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/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2024-11-07 15:11:49,017 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/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2024-11-07 15:11:49,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:11:49,064 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:11:49,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49 WrapperNode [2024-11-07 15:11:49,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:11:49,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:11:49,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:11:49,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:11:49,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,134 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1477 [2024-11-07 15:11:49,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:11:49,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:11:49,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:11:49,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:11:49,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,199 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 220, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 49, 4]. [2024-11-07 15:11:49,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:11:49,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:11:49,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:11:49,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:11:49,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (1/1) ... [2024-11-07 15:11:49,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:11:49,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:11:49,309 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 15:11:49,319 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 15:11:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 15:11:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 15:11:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 15:11:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 15:11:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-07 15:11:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 15:11:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-07 15:11:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-07 15:11:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 15:11:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 15:11:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:11:49,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:11:49,538 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:11:49,540 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:11:50,769 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-11-07 15:11:50,769 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:11:50,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:11:50,809 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-07 15:11:50,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:11:50 BoogieIcfgContainer [2024-11-07 15:11:50,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:11:50,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:11:50,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:11:50,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:11:50,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:11:48" (1/3) ... [2024-11-07 15:11:50,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5c4483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:11:50, skipping insertion in model container [2024-11-07 15:11:50,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:11:49" (2/3) ... [2024-11-07 15:11:50,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5c4483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:11:50, skipping insertion in model container [2024-11-07 15:11:50,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:11:50" (3/3) ... [2024-11-07 15:11:50,820 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2024-11-07 15:11:50,831 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:11:50,831 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 15:11:50,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:11:50,881 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;@254717d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:11:50,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 15:11:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 435 states, 413 states have (on average 1.5980629539951574) internal successors, (660), 417 states have internal predecessors, (660), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 15:11:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 15:11:50,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:50,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:11:50,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:50,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1705359720, now seen corresponding path program 1 times [2024-11-07 15:11:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:50,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83080046] [2024-11-07 15:11:50,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:51,074 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 15:11:51,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:51,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83080046] [2024-11-07 15:11:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83080046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:51,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:11:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592556508] [2024-11-07 15:11:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:51,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:11:51,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:51,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:11:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:11:51,115 INFO L87 Difference]: Start difference. First operand has 435 states, 413 states have (on average 1.5980629539951574) internal successors, (660), 417 states have internal predecessors, (660), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:51,179 INFO L93 Difference]: Finished difference Result 865 states and 1380 transitions. [2024-11-07 15:11:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:11:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 15:11:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:51,187 INFO L225 Difference]: With dead ends: 865 [2024-11-07 15:11:51,187 INFO L226 Difference]: Without dead ends: 428 [2024-11-07 15:11:51,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:11:51,192 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:51,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 15:11:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-07 15:11:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2024-11-07 15:11:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.434889434889435) internal successors, (584), 412 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 609 transitions. [2024-11-07 15:11:51,232 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 609 transitions. Word has length 8 [2024-11-07 15:11:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:51,233 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 609 transitions. [2024-11-07 15:11:51,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 609 transitions. [2024-11-07 15:11:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 15:11:51,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:51,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:11:51,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:11:51,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:51,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash -68909494, now seen corresponding path program 1 times [2024-11-07 15:11:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371430134] [2024-11-07 15:11:51,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:51,409 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 15:11:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371430134] [2024-11-07 15:11:51,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371430134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:51,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:11:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012982212] [2024-11-07 15:11:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:51,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:11:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:11:51,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:11:51,411 INFO L87 Difference]: Start difference. First operand 428 states and 609 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:51,576 INFO L93 Difference]: Finished difference Result 1041 states and 1492 transitions. [2024-11-07 15:11:51,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:11:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-07 15:11:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:51,586 INFO L225 Difference]: With dead ends: 1041 [2024-11-07 15:11:51,586 INFO L226 Difference]: Without dead ends: 829 [2024-11-07 15:11:51,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:11:51,588 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 557 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:51,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1841 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:11:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-07 15:11:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 430. [2024-11-07 15:11:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.4327628361858191) internal successors, (586), 414 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 611 transitions. [2024-11-07 15:11:51,625 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 611 transitions. Word has length 10 [2024-11-07 15:11:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:51,625 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 611 transitions. [2024-11-07 15:11:51,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 611 transitions. [2024-11-07 15:11:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:11:51,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:51,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:11:51,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:11:51,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:51,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1469408361, now seen corresponding path program 1 times [2024-11-07 15:11:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:51,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319607926] [2024-11-07 15:11:51,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:51,906 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 15:11:51,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319607926] [2024-11-07 15:11:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319607926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:51,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:51,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:11:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239281494] [2024-11-07 15:11:51,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:51,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:11:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:51,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:11:51,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:11:51,907 INFO L87 Difference]: Start difference. First operand 430 states and 611 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:51,992 INFO L93 Difference]: Finished difference Result 814 states and 1152 transitions. [2024-11-07 15:11:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:11:51,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 15:11:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:51,997 INFO L225 Difference]: With dead ends: 814 [2024-11-07 15:11:51,997 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 15:11:51,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:11:51,999 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 36 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:52,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1498 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:11:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 15:11:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-11-07 15:11:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 367 states have (on average 1.3869209809264305) internal successors, (509), 372 states have internal predecessors, (509), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 534 transitions. [2024-11-07 15:11:52,020 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 534 transitions. Word has length 66 [2024-11-07 15:11:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:52,020 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 534 transitions. [2024-11-07 15:11:52,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 534 transitions. [2024-11-07 15:11:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:11:52,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:52,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:11:52,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:11:52,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:52,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1801171157, now seen corresponding path program 1 times [2024-11-07 15:11:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764709669] [2024-11-07 15:11:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:52,137 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 15:11:52,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764709669] [2024-11-07 15:11:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764709669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:52,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:52,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:11:52,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773969575] [2024-11-07 15:11:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:52,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:11:52,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:52,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:11:52,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:11:52,139 INFO L87 Difference]: Start difference. First operand 388 states and 534 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:52,196 INFO L93 Difference]: Finished difference Result 766 states and 1058 transitions. [2024-11-07 15:11:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:11:52,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 15:11:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:52,198 INFO L225 Difference]: With dead ends: 766 [2024-11-07 15:11:52,198 INFO L226 Difference]: Without dead ends: 382 [2024-11-07 15:11:52,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:11:52,200 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 9 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:52,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1499 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 15:11:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-07 15:11:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2024-11-07 15:11:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 361 states have (on average 1.3822714681440442) internal successors, (499), 366 states have internal predecessors, (499), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 524 transitions. [2024-11-07 15:11:52,209 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 524 transitions. Word has length 66 [2024-11-07 15:11:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:52,209 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 524 transitions. [2024-11-07 15:11:52,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 524 transitions. [2024-11-07 15:11:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 15:11:52,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:52,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] [2024-11-07 15:11:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:11:52,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:52,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1749246755, now seen corresponding path program 1 times [2024-11-07 15:11:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111326924] [2024-11-07 15:11:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:52,594 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 15:11:52,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:52,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111326924] [2024-11-07 15:11:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111326924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:52,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:52,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:11:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842301177] [2024-11-07 15:11:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:52,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:11:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:11:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:11:52,596 INFO L87 Difference]: Start difference. First operand 382 states and 524 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:52,873 INFO L93 Difference]: Finished difference Result 765 states and 1052 transitions. [2024-11-07 15:11:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:11:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 15:11:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:52,878 INFO L225 Difference]: With dead ends: 765 [2024-11-07 15:11:52,878 INFO L226 Difference]: Without dead ends: 387 [2024-11-07 15:11:52,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:11:52,879 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 10 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:52,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2242 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:11:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-07 15:11:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2024-11-07 15:11:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.3801652892561984) internal successors, (501), 368 states have internal predecessors, (501), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 526 transitions. [2024-11-07 15:11:52,896 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 526 transitions. Word has length 66 [2024-11-07 15:11:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:52,900 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 526 transitions. [2024-11-07 15:11:52,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 526 transitions. [2024-11-07 15:11:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 15:11:52,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:52,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:11:52,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:11:52,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:52,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:52,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1465973530, now seen corresponding path program 1 times [2024-11-07 15:11:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:52,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084860724] [2024-11-07 15:11:52,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:52,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:53,199 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 15:11:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084860724] [2024-11-07 15:11:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084860724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:53,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:53,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:11:53,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202690419] [2024-11-07 15:11:53,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 15:11:53,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:53,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 15:11:53,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:11:53,201 INFO L87 Difference]: Start difference. First operand 384 states and 526 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:53,301 INFO L93 Difference]: Finished difference Result 764 states and 1048 transitions. [2024-11-07 15:11:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 15:11:53,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 15:11:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:53,303 INFO L225 Difference]: With dead ends: 764 [2024-11-07 15:11:53,303 INFO L226 Difference]: Without dead ends: 384 [2024-11-07 15:11:53,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 15:11:53,305 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 13 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:53,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1411 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 15:11:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-07 15:11:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-07 15:11:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.3774104683195592) internal successors, (500), 368 states have internal predecessors, (500), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 525 transitions. [2024-11-07 15:11:53,314 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 525 transitions. Word has length 67 [2024-11-07 15:11:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:53,314 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 525 transitions. [2024-11-07 15:11:53,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 525 transitions. [2024-11-07 15:11:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 15:11:53,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:53,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:11:53,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:11:53,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:53,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash -368632186, now seen corresponding path program 1 times [2024-11-07 15:11:53,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:53,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277218174] [2024-11-07 15:11:53,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:53,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:53,529 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 15:11:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277218174] [2024-11-07 15:11:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277218174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:53,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:53,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:11:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962573384] [2024-11-07 15:11:53,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:53,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:11:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:11:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:11:53,530 INFO L87 Difference]: Start difference. First operand 384 states and 525 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:53,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:53,763 INFO L93 Difference]: Finished difference Result 769 states and 1054 transitions. [2024-11-07 15:11:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:11:53,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 15:11:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:53,766 INFO L225 Difference]: With dead ends: 769 [2024-11-07 15:11:53,766 INFO L226 Difference]: Without dead ends: 389 [2024-11-07 15:11:53,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:11:53,767 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 10 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:53,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2690 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:11:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-07 15:11:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 388. [2024-11-07 15:11:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 367 states have (on average 1.3760217983651226) internal successors, (505), 372 states have internal predecessors, (505), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 530 transitions. [2024-11-07 15:11:53,776 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 530 transitions. Word has length 67 [2024-11-07 15:11:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:53,776 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 530 transitions. [2024-11-07 15:11:53,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 530 transitions. [2024-11-07 15:11:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:11:53,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:53,777 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] [2024-11-07 15:11:53,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:11:53,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:53,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash -187413054, now seen corresponding path program 1 times [2024-11-07 15:11:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:53,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249959327] [2024-11-07 15:11:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:54,014 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 15:11:54,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:54,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249959327] [2024-11-07 15:11:54,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249959327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:54,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:54,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 15:11:54,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259575159] [2024-11-07 15:11:54,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:54,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:11:54,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:54,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:11:54,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:11:54,016 INFO L87 Difference]: Start difference. First operand 388 states and 530 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:54,224 INFO L93 Difference]: Finished difference Result 775 states and 1061 transitions. [2024-11-07 15:11:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:11:54,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 15:11:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:54,227 INFO L225 Difference]: With dead ends: 775 [2024-11-07 15:11:54,227 INFO L226 Difference]: Without dead ends: 391 [2024-11-07 15:11:54,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:11:54,228 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 4 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:54,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2265 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:11:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-07 15:11:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-07 15:11:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 370 states have (on average 1.372972972972973) internal successors, (508), 375 states have internal predecessors, (508), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 533 transitions. [2024-11-07 15:11:54,244 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 533 transitions. Word has length 68 [2024-11-07 15:11:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:54,244 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 533 transitions. [2024-11-07 15:11:54,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 533 transitions. [2024-11-07 15:11:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:11:54,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:54,248 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] [2024-11-07 15:11:54,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:11:54,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:54,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1333583977, now seen corresponding path program 1 times [2024-11-07 15:11:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:54,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417312669] [2024-11-07 15:11:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:54,539 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 15:11:54,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:54,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417312669] [2024-11-07 15:11:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417312669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:54,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:54,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:11:54,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16124105] [2024-11-07 15:11:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:54,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:11:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:54,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:11:54,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:11:54,541 INFO L87 Difference]: Start difference. First operand 391 states and 533 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:54,900 INFO L93 Difference]: Finished difference Result 791 states and 1083 transitions. [2024-11-07 15:11:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:11:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 15:11:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:54,903 INFO L225 Difference]: With dead ends: 791 [2024-11-07 15:11:54,903 INFO L226 Difference]: Without dead ends: 404 [2024-11-07 15:11:54,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 15:11:54,904 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 30 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:54,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3633 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:11:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-07 15:11:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2024-11-07 15:11:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 380 states have (on average 1.3736842105263158) internal successors, (522), 385 states have internal predecessors, (522), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 547 transitions. [2024-11-07 15:11:54,913 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 547 transitions. Word has length 68 [2024-11-07 15:11:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:54,913 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 547 transitions. [2024-11-07 15:11:54,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2024-11-07 15:11:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 15:11:54,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:54,914 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] [2024-11-07 15:11:54,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:11:54,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:54,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1348712318, now seen corresponding path program 1 times [2024-11-07 15:11:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495743518] [2024-11-07 15:11:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:55,298 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 15:11:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495743518] [2024-11-07 15:11:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495743518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:55,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:55,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:11:55,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67405027] [2024-11-07 15:11:55,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:11:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:55,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:11:55,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:11:55,300 INFO L87 Difference]: Start difference. First operand 401 states and 547 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:55,727 INFO L93 Difference]: Finished difference Result 801 states and 1095 transitions. [2024-11-07 15:11:55,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 15:11:55,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 15:11:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:55,732 INFO L225 Difference]: With dead ends: 801 [2024-11-07 15:11:55,732 INFO L226 Difference]: Without dead ends: 404 [2024-11-07 15:11:55,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:11:55,733 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 23 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:55,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3182 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:11:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-07 15:11:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-07 15:11:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 383 states have (on average 1.370757180156658) internal successors, (525), 388 states have internal predecessors, (525), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 550 transitions. [2024-11-07 15:11:55,745 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 550 transitions. Word has length 68 [2024-11-07 15:11:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:55,745 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 550 transitions. [2024-11-07 15:11:55,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 550 transitions. [2024-11-07 15:11:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 15:11:55,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:55,746 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] [2024-11-07 15:11:55,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:11:55,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:55,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1149610205, now seen corresponding path program 1 times [2024-11-07 15:11:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019608364] [2024-11-07 15:11:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:55,960 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 15:11:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019608364] [2024-11-07 15:11:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019608364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:55,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:55,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:11:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317246626] [2024-11-07 15:11:55,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:55,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:11:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:11:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:11:55,962 INFO L87 Difference]: Start difference. First operand 404 states and 550 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:56,229 INFO L93 Difference]: Finished difference Result 809 states and 1104 transitions. [2024-11-07 15:11:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:11:56,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 15:11:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:56,233 INFO L225 Difference]: With dead ends: 809 [2024-11-07 15:11:56,233 INFO L226 Difference]: Without dead ends: 409 [2024-11-07 15:11:56,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:11:56,235 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 9 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:56,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2696 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:11:56,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-07 15:11:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 404. [2024-11-07 15:11:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 383 states have (on average 1.370757180156658) internal successors, (525), 388 states have internal predecessors, (525), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 550 transitions. [2024-11-07 15:11:56,245 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 550 transitions. Word has length 69 [2024-11-07 15:11:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:56,245 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 550 transitions. [2024-11-07 15:11:56,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 550 transitions. [2024-11-07 15:11:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 15:11:56,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:56,246 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] [2024-11-07 15:11:56,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:11:56,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:56,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:56,247 INFO L85 PathProgramCache]: Analyzing trace with hash 412879753, now seen corresponding path program 1 times [2024-11-07 15:11:56,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:56,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24229038] [2024-11-07 15:11:56,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:56,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:56,712 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 15:11:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24229038] [2024-11-07 15:11:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24229038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:56,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:11:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428987712] [2024-11-07 15:11:56,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:11:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:11:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:11:56,714 INFO L87 Difference]: Start difference. First operand 404 states and 550 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:57,276 INFO L93 Difference]: Finished difference Result 1162 states and 1596 transitions. [2024-11-07 15:11:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:11:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 15:11:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:57,279 INFO L225 Difference]: With dead ends: 1162 [2024-11-07 15:11:57,279 INFO L226 Difference]: Without dead ends: 762 [2024-11-07 15:11:57,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 15:11:57,281 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 600 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:57,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 2664 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 15:11:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-07 15:11:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 436. [2024-11-07 15:11:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 415 states have (on average 1.342168674698795) internal successors, (557), 420 states have internal predecessors, (557), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 582 transitions. [2024-11-07 15:11:57,294 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 582 transitions. Word has length 69 [2024-11-07 15:11:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:57,294 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 582 transitions. [2024-11-07 15:11:57,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 582 transitions. [2024-11-07 15:11:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 15:11:57,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:57,295 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] [2024-11-07 15:11:57,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:11:57,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:57,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:57,296 INFO L85 PathProgramCache]: Analyzing trace with hash -982782962, now seen corresponding path program 1 times [2024-11-07 15:11:57,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:57,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071532442] [2024-11-07 15:11:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:57,484 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 15:11:57,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071532442] [2024-11-07 15:11:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071532442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:11:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545546880] [2024-11-07 15:11:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:57,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:11:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:11:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:11:57,486 INFO L87 Difference]: Start difference. First operand 436 states and 582 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:57,702 INFO L93 Difference]: Finished difference Result 846 states and 1142 transitions. [2024-11-07 15:11:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:11:57,703 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-07 15:11:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:57,705 INFO L225 Difference]: With dead ends: 846 [2024-11-07 15:11:57,705 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 15:11:57,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:11:57,706 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 16 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:57,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2785 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:11:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 15:11:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 439. [2024-11-07 15:11:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 418 states have (on average 1.3421052631578947) internal successors, (561), 423 states have internal predecessors, (561), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 586 transitions. [2024-11-07 15:11:57,720 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 586 transitions. Word has length 70 [2024-11-07 15:11:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:57,720 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 586 transitions. [2024-11-07 15:11:57,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 586 transitions. [2024-11-07 15:11:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 15:11:57,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:57,721 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] [2024-11-07 15:11:57,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:11:57,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:57,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:57,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1154457842, now seen corresponding path program 1 times [2024-11-07 15:11:57,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:57,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828132655] [2024-11-07 15:11:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:57,930 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 15:11:57,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:57,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828132655] [2024-11-07 15:11:57,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828132655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:57,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:57,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:11:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052363449] [2024-11-07 15:11:57,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:57,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:11:57,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:57,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:11:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:11:57,931 INFO L87 Difference]: Start difference. First operand 439 states and 586 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:58,295 INFO L93 Difference]: Finished difference Result 852 states and 1150 transitions. [2024-11-07 15:11:58,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:11:58,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-07 15:11:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:58,298 INFO L225 Difference]: With dead ends: 852 [2024-11-07 15:11:58,298 INFO L226 Difference]: Without dead ends: 449 [2024-11-07 15:11:58,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:11:58,299 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 26 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:58,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3569 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:11:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-07 15:11:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2024-11-07 15:11:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 418 states have (on average 1.3421052631578947) internal successors, (561), 423 states have internal predecessors, (561), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 586 transitions. [2024-11-07 15:11:58,310 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 586 transitions. Word has length 70 [2024-11-07 15:11:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:58,310 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 586 transitions. [2024-11-07 15:11:58,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 586 transitions. [2024-11-07 15:11:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:11:58,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:58,311 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] [2024-11-07 15:11:58,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:11:58,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:58,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -630555315, now seen corresponding path program 1 times [2024-11-07 15:11:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097261075] [2024-11-07 15:11:58,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:58,558 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 15:11:58,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:58,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097261075] [2024-11-07 15:11:58,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097261075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:58,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:58,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:11:58,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889401769] [2024-11-07 15:11:58,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:58,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:11:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:11:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:11:58,561 INFO L87 Difference]: Start difference. First operand 439 states and 586 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:58,909 INFO L93 Difference]: Finished difference Result 858 states and 1159 transitions. [2024-11-07 15:11:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:11:58,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 15:11:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:58,911 INFO L225 Difference]: With dead ends: 858 [2024-11-07 15:11:58,911 INFO L226 Difference]: Without dead ends: 455 [2024-11-07 15:11:58,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 15:11:58,912 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 22 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:58,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3624 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:11:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-07 15:11:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 449. [2024-11-07 15:11:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 428 states have (on average 1.338785046728972) internal successors, (573), 433 states have internal predecessors, (573), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 598 transitions. [2024-11-07 15:11:58,929 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 598 transitions. Word has length 71 [2024-11-07 15:11:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:58,929 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 598 transitions. [2024-11-07 15:11:58,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 598 transitions. [2024-11-07 15:11:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:11:58,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:58,930 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] [2024-11-07 15:11:58,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:11:58,930 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:58,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1199400169, now seen corresponding path program 1 times [2024-11-07 15:11:58,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:58,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764059089] [2024-11-07 15:11:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:59,209 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 15:11:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764059089] [2024-11-07 15:11:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764059089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:59,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:59,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:11:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22352475] [2024-11-07 15:11:59,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:59,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:11:59,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:59,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:11:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:11:59,212 INFO L87 Difference]: Start difference. First operand 449 states and 598 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:11:59,595 INFO L93 Difference]: Finished difference Result 878 states and 1183 transitions. [2024-11-07 15:11:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:11:59,595 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 15:11:59,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:11:59,597 INFO L225 Difference]: With dead ends: 878 [2024-11-07 15:11:59,597 INFO L226 Difference]: Without dead ends: 465 [2024-11-07 15:11:59,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:11:59,598 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 13 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4046 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:11:59,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4046 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:11:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-07 15:11:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 452. [2024-11-07 15:11:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.3387470997679813) internal successors, (577), 436 states have internal predecessors, (577), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:11:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 602 transitions. [2024-11-07 15:11:59,614 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 602 transitions. Word has length 71 [2024-11-07 15:11:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:11:59,614 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 602 transitions. [2024-11-07 15:11:59,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:11:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 602 transitions. [2024-11-07 15:11:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:11:59,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:11:59,616 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] [2024-11-07 15:11:59,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:11:59,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:11:59,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:11:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash -298652567, now seen corresponding path program 1 times [2024-11-07 15:11:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:11:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023638566] [2024-11-07 15:11:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:11:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:11:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:11:59,833 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 15:11:59,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:11:59,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023638566] [2024-11-07 15:11:59,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023638566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:11:59,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:11:59,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:11:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474650862] [2024-11-07 15:11:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:11:59,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:11:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:11:59,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:11:59,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:11:59,835 INFO L87 Difference]: Start difference. First operand 452 states and 602 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:12:00,054 INFO L93 Difference]: Finished difference Result 873 states and 1173 transitions. [2024-11-07 15:12:00,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:12:00,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 15:12:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:12:00,057 INFO L225 Difference]: With dead ends: 873 [2024-11-07 15:12:00,057 INFO L226 Difference]: Without dead ends: 457 [2024-11-07 15:12:00,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:12:00,058 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 7 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:12:00,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2720 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:12:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-07 15:12:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 452. [2024-11-07 15:12:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.3364269141531322) internal successors, (576), 436 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:12:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 601 transitions. [2024-11-07 15:12:00,070 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 601 transitions. Word has length 71 [2024-11-07 15:12:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:12:00,070 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 601 transitions. [2024-11-07 15:12:00,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 601 transitions. [2024-11-07 15:12:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 15:12:00,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:12:00,071 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] [2024-11-07 15:12:00,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:12:00,072 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:12:00,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:12:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1314018434, now seen corresponding path program 1 times [2024-11-07 15:12:00,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:12:00,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45073580] [2024-11-07 15:12:00,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:12:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:12:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:12:00,284 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 15:12:00,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:12:00,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45073580] [2024-11-07 15:12:00,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45073580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:12:00,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:12:00,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:12:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775095242] [2024-11-07 15:12:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:12:00,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:12:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:12:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:12:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:12:00,286 INFO L87 Difference]: Start difference. First operand 452 states and 601 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:12:00,776 INFO L93 Difference]: Finished difference Result 871 states and 1171 transitions. [2024-11-07 15:12:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 15:12:00,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 15:12:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:12:00,782 INFO L225 Difference]: With dead ends: 871 [2024-11-07 15:12:00,782 INFO L226 Difference]: Without dead ends: 455 [2024-11-07 15:12:00,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:12:00,783 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 4 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 15:12:00,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2679 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 15:12:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-07 15:12:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-07 15:12:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 434 states have (on average 1.3341013824884793) internal successors, (579), 439 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:12:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 604 transitions. [2024-11-07 15:12:00,795 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 604 transitions. Word has length 71 [2024-11-07 15:12:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:12:00,795 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 604 transitions. [2024-11-07 15:12:00,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 604 transitions. [2024-11-07 15:12:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:12:00,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:12:00,798 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] [2024-11-07 15:12:00,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:12:00,798 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:12:00,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:12:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1396403887, now seen corresponding path program 1 times [2024-11-07 15:12:00,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:12:00,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770297170] [2024-11-07 15:12:00,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:12:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:12:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:12:01,111 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 15:12:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:12:01,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770297170] [2024-11-07 15:12:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770297170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:12:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:12:01,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:12:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945317930] [2024-11-07 15:12:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:12:01,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:12:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:12:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:12:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:12:01,112 INFO L87 Difference]: Start difference. First operand 455 states and 604 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:12:01,519 INFO L93 Difference]: Finished difference Result 886 states and 1190 transitions. [2024-11-07 15:12:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:12:01,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 15:12:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:12:01,522 INFO L225 Difference]: With dead ends: 886 [2024-11-07 15:12:01,522 INFO L226 Difference]: Without dead ends: 467 [2024-11-07 15:12:01,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:12:01,523 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 9 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3610 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:12:01,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3610 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:12:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-07 15:12:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 459. [2024-11-07 15:12:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3333333333333333) internal successors, (584), 443 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:12:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 609 transitions. [2024-11-07 15:12:01,539 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 609 transitions. Word has length 72 [2024-11-07 15:12:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:12:01,539 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 609 transitions. [2024-11-07 15:12:01,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 609 transitions. [2024-11-07 15:12:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:12:01,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:12:01,540 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] [2024-11-07 15:12:01,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:12:01,540 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:12:01,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:12:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash 532169790, now seen corresponding path program 1 times [2024-11-07 15:12:01,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:12:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335245052] [2024-11-07 15:12:01,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:12:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:12:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:12:01,793 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 15:12:01,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:12:01,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335245052] [2024-11-07 15:12:01,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335245052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:12:01,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:12:01,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:12:01,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168683722] [2024-11-07 15:12:01,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:12:01,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:12:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:12:01,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:12:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:12:01,794 INFO L87 Difference]: Start difference. First operand 459 states and 609 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:12:02,175 INFO L93 Difference]: Finished difference Result 895 states and 1200 transitions. [2024-11-07 15:12:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:12:02,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 15:12:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:12:02,178 INFO L225 Difference]: With dead ends: 895 [2024-11-07 15:12:02,178 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 15:12:02,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:12:02,179 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 36 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4076 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:12:02,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4076 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 15:12:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 15:12:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 462. [2024-11-07 15:12:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 441 states have (on average 1.3310657596371882) internal successors, (587), 446 states have internal predecessors, (587), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:12:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 612 transitions. [2024-11-07 15:12:02,194 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 612 transitions. Word has length 72 [2024-11-07 15:12:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:12:02,195 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 612 transitions. [2024-11-07 15:12:02,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 612 transitions. [2024-11-07 15:12:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:12:02,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:12:02,196 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] [2024-11-07 15:12:02,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:12:02,197 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:12:02,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:12:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash -502358731, now seen corresponding path program 1 times [2024-11-07 15:12:02,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:12:02,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758086688] [2024-11-07 15:12:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:12:02,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:12:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:12:02,649 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 15:12:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:12:02,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758086688] [2024-11-07 15:12:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758086688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:12:02,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:12:02,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:12:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539077926] [2024-11-07 15:12:02,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:12:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:12:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:12:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:12:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:12:02,652 INFO L87 Difference]: Start difference. First operand 462 states and 612 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:12:03,467 INFO L93 Difference]: Finished difference Result 894 states and 1196 transitions. [2024-11-07 15:12:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:12:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 15:12:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:12:03,469 INFO L225 Difference]: With dead ends: 894 [2024-11-07 15:12:03,469 INFO L226 Difference]: Without dead ends: 468 [2024-11-07 15:12:03,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-07 15:12:03,470 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 33 mSDsluCounter, 3040 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 15:12:03,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3539 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 15:12:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-07 15:12:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 463. [2024-11-07 15:12:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 442 states have (on average 1.330316742081448) internal successors, (588), 447 states have internal predecessors, (588), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:12:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 613 transitions. [2024-11-07 15:12:03,481 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 613 transitions. Word has length 72 [2024-11-07 15:12:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:12:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 613 transitions. [2024-11-07 15:12:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 613 transitions. [2024-11-07 15:12:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:12:03,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:12:03,482 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] [2024-11-07 15:12:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:12:03,482 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:12:03,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:12:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1956145645, now seen corresponding path program 1 times [2024-11-07 15:12:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:12:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138493828] [2024-11-07 15:12:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:12:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:12:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:12:03,635 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 15:12:03,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:12:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138493828] [2024-11-07 15:12:03,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138493828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:12:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:12:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 15:12:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572432820] [2024-11-07 15:12:03,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:12:03,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:12:03,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:12:03,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:12:03,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:12:03,637 INFO L87 Difference]: Start difference. First operand 463 states and 613 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:12:03,994 INFO L93 Difference]: Finished difference Result 899 states and 1203 transitions. [2024-11-07 15:12:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:12:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 15:12:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:12:03,997 INFO L225 Difference]: With dead ends: 899 [2024-11-07 15:12:03,997 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 15:12:03,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:12:03,999 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 22 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 15:12:03,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3569 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 15:12:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 15:12:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 460. [2024-11-07 15:12:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 439 states have (on average 1.3325740318906605) internal successors, (585), 444 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 15:12:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 610 transitions. [2024-11-07 15:12:04,028 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 610 transitions. Word has length 72 [2024-11-07 15:12:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:12:04,028 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 610 transitions. [2024-11-07 15:12:04,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 610 transitions. [2024-11-07 15:12:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 15:12:04,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:12:04,029 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] [2024-11-07 15:12:04,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:12:04,029 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 15:12:04,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:12:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1353154441, now seen corresponding path program 1 times [2024-11-07 15:12:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:12:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125488280] [2024-11-07 15:12:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:12:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:12:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:12:14,406 WARN L286 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 15:12:22,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-11-07 15:12:22,705 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 15:12:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:12:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125488280] [2024-11-07 15:12:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125488280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:12:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:12:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:12:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533808074] [2024-11-07 15:12:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:12:22,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:12:22,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:12:22,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:12:22,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-07 15:12:22,707 INFO L87 Difference]: Start difference. First operand 460 states and 610 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:12:26,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:12:30,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:12:34,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:12:37,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:12:41,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2024-11-07 15:12:46,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:12:50,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:12:54,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:12:58,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:13:02,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:13:05,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:13:09,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:13:13,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:13:17,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:13:21,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 15:13:25,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []