./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd --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 bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:22:25,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:22:25,519 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:22:25,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:22:25,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:22:25,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:22:25,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:22:25,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:22:25,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:22:25,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:22:25,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:22:25,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:22:25,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:22:25,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:22:25,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:22:25,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:22:25,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:22:25,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:22:25,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:22:25,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:22:25,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:22:25,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:22:25,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:22:25,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:22:25,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:22:25,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:22:25,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:22:25,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:22:25,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:22:25,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:22:25,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:22:25,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:22:25,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:22:25,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:22:25,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:22:25,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:22:25,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:22:25,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:22:25,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:22:25,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:22:25,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:22:25,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:22:25,580 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-13 15:22:25,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:22:25,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:22:25,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:22:25,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:22:25,984 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:22:25,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i Unable to find full path for "g++" [2024-11-13 15:22:27,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:22:28,317 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:22:28,320 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-13 15:22:28,350 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/data/dc5104e9e/0ca2ed93293440a88f40615c1823139a/FLAGdfacf9bf9 [2024-11-13 15:22:28,367 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/data/dc5104e9e/0ca2ed93293440a88f40615c1823139a [2024-11-13 15:22:28,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:22:28,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:22:28,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:22:28,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:22:28,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:22:28,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:22:28" (1/1) ... [2024-11-13 15:22:28,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7b5c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:28, skipping insertion in model container [2024-11-13 15:22:28,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:22:28" (1/1) ... [2024-11-13 15:22:28,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:22:29,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2024-11-13 15:22:29,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2024-11-13 15:22:29,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2024-11-13 15:22:29,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2024-11-13 15:22:29,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:22:29,209 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:22:29,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2024-11-13 15:22:29,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2024-11-13 15:22:29,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2024-11-13 15:22:29,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2024-11-13 15:22:29,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:22:29,495 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:22:29,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29 WrapperNode [2024-11-13 15:22:29,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:22:29,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:22:29,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:22:29,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:22:29,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,651 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1607 [2024-11-13 15:22:29,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:22:29,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:22:29,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:22:29,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:22:29,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,823 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [270, 2, 12, 34]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [0, 2, 10, 0]. The 62 writes are split as follows [57, 0, 1, 4]. [2024-11-13 15:22:29,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:22:29,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:22:29,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:22:29,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:22:29,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (1/1) ... [2024-11-13 15:22:29,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:22:29,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:22:29,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:22:29,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b17ab6-1e4b-446c-b59c-6dcbae21f67c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:22:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:22:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:22:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:22:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:22:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-13 15:22:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:22:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-13 15:22:30,024 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-13 15:22:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:22:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:22:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:22:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 15:22:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 15:22:30,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 15:22:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:22:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:22:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 15:22:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 15:22:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:22:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:22:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-13 15:22:30,027 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-13 15:22:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:22:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:22:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:22:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-13 15:22:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-13 15:22:30,028 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-13 15:22:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:22:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:22:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:22:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 15:22:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:22:30,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:22:30,328 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:22:30,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:22:32,405 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2024-11-13 15:22:32,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:22:32,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:22:32,444 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-13 15:22:32,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:22:32 BoogieIcfgContainer [2024-11-13 15:22:32,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:22:32,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:22:32,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:22:32,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:22:32,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:22:28" (1/3) ... [2024-11-13 15:22:32,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7476fc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:22:32, skipping insertion in model container [2024-11-13 15:22:32,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:22:29" (2/3) ... [2024-11-13 15:22:32,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7476fc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:22:32, skipping insertion in model container [2024-11-13 15:22:32,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:22:32" (3/3) ... [2024-11-13 15:22:32,463 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2024-11-13 15:22:32,482 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:22:32,484 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test6-2.i that has 5 procedures, 472 locations, 1 initial locations, 41 loop locations, and 4 error locations. [2024-11-13 15:22:32,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:22:32,607 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;@16b4227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:22:32,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-13 15:22:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 472 states, 448 states have (on average 1.6004464285714286) internal successors, (717), 452 states have internal predecessors, (717), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 15:22:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 15:22:32,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:32,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:22:32,624 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-13 15:22:32,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1349958056, now seen corresponding path program 1 times [2024-11-13 15:22:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820267697] [2024-11-13 15:22:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:32,873 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-13 15:22:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820267697] [2024-11-13 15:22:32,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820267697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:32,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:22:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467552306] [2024-11-13 15:22:32,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:32,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:22:32,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:32,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:22:32,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:22:32,921 INFO L87 Difference]: Start difference. First operand has 472 states, 448 states have (on average 1.6004464285714286) internal successors, (717), 452 states have internal predecessors, (717), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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-13 15:22:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:33,023 INFO L93 Difference]: Finished difference Result 940 states and 1505 transitions. [2024-11-13 15:22:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:22:33,026 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-13 15:22:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:33,041 INFO L225 Difference]: With dead ends: 940 [2024-11-13 15:22:33,041 INFO L226 Difference]: Without dead ends: 466 [2024-11-13 15:22:33,049 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-13 15:22:33,052 INFO L432 NwaCegarLoop]: 666 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, 666 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-13 15:22:33,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:22:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-13 15:22:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-11-13 15:22:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 443 states have (on average 1.4266365688487586) internal successors, (632), 447 states have internal predecessors, (632), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 662 transitions. [2024-11-13 15:22:33,158 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 662 transitions. Word has length 8 [2024-11-13 15:22:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:33,159 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 662 transitions. [2024-11-13 15:22:33,159 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-13 15:22:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 662 transitions. [2024-11-13 15:22:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 15:22:33,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:33,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:22:33,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:22:33,161 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-13 15:22:33,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -423923875, now seen corresponding path program 1 times [2024-11-13 15:22:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:33,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847683487] [2024-11-13 15:22:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:33,443 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-13 15:22:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847683487] [2024-11-13 15:22:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847683487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:33,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:22:33,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569779758] [2024-11-13 15:22:33,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:33,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:22:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:33,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:22:33,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:22:33,448 INFO L87 Difference]: Start difference. First operand 466 states and 662 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-13 15:22:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:33,704 INFO L93 Difference]: Finished difference Result 1155 states and 1651 transitions. [2024-11-13 15:22:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:22:33,704 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-13 15:22:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:33,710 INFO L225 Difference]: With dead ends: 1155 [2024-11-13 15:22:33,710 INFO L226 Difference]: Without dead ends: 905 [2024-11-13 15:22:33,712 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-13 15:22:33,713 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 605 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:33,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 2120 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:22:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-13 15:22:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 468. [2024-11-13 15:22:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 445 states have (on average 1.4247191011235956) internal successors, (634), 449 states have internal predecessors, (634), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 664 transitions. [2024-11-13 15:22:33,750 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 664 transitions. Word has length 10 [2024-11-13 15:22:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:33,750 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 664 transitions. [2024-11-13 15:22:33,750 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-13 15:22:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 664 transitions. [2024-11-13 15:22:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 15:22:33,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:33,753 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-13 15:22:33,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:22:33,753 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-13 15:22:33,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash -484271845, now seen corresponding path program 1 times [2024-11-13 15:22:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:33,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039469788] [2024-11-13 15:22:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:34,289 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-13 15:22:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039469788] [2024-11-13 15:22:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039469788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:34,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:34,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:22:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256936869] [2024-11-13 15:22:34,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:34,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:22:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:34,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:22:34,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:22:34,293 INFO L87 Difference]: Start difference. First operand 468 states and 664 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-13 15:22:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:34,434 INFO L93 Difference]: Finished difference Result 890 states and 1258 transitions. [2024-11-13 15:22:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:22:34,435 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-13 15:22:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:34,438 INFO L225 Difference]: With dead ends: 890 [2024-11-13 15:22:34,438 INFO L226 Difference]: Without dead ends: 426 [2024-11-13 15:22:34,439 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-13 15:22:34,440 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 30 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:34,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1661 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:22:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-13 15:22:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2024-11-13 15:22:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 403 states have (on average 1.382133995037221) internal successors, (557), 407 states have internal predecessors, (557), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 587 transitions. [2024-11-13 15:22:34,472 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 587 transitions. Word has length 66 [2024-11-13 15:22:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:34,472 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 587 transitions. [2024-11-13 15:22:34,472 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-13 15:22:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 587 transitions. [2024-11-13 15:22:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 15:22:34,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:34,476 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-13 15:22:34,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:22:34,477 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-13 15:22:34,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1269620879, now seen corresponding path program 1 times [2024-11-13 15:22:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:34,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075502965] [2024-11-13 15:22:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:35,347 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-13 15:22:35,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075502965] [2024-11-13 15:22:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075502965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:35,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:35,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:22:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979278086] [2024-11-13 15:22:35,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:22:35,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:22:35,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:22:35,353 INFO L87 Difference]: Start difference. First operand 426 states and 587 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-13 15:22:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:35,873 INFO L93 Difference]: Finished difference Result 853 states and 1178 transitions. [2024-11-13 15:22:35,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:22:35,874 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-13 15:22:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:35,879 INFO L225 Difference]: With dead ends: 853 [2024-11-13 15:22:35,879 INFO L226 Difference]: Without dead ends: 431 [2024-11-13 15:22:35,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:22:35,880 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 14 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2523 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.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:35,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2523 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:22:35,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-13 15:22:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2024-11-13 15:22:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 405 states have (on average 1.3802469135802469) internal successors, (559), 409 states have internal predecessors, (559), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 589 transitions. [2024-11-13 15:22:35,906 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 589 transitions. Word has length 66 [2024-11-13 15:22:35,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:35,906 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 589 transitions. [2024-11-13 15:22:35,907 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-13 15:22:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 589 transitions. [2024-11-13 15:22:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 15:22:35,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:35,911 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-13 15:22:35,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:22:35,912 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-13 15:22:35,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1999439448, now seen corresponding path program 1 times [2024-11-13 15:22:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:35,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502566791] [2024-11-13 15:22:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:36,350 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-13 15:22:36,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:36,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502566791] [2024-11-13 15:22:36,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502566791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:36,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:36,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:22:36,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791539247] [2024-11-13 15:22:36,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:36,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:22:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:36,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:22:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:22:36,352 INFO L87 Difference]: Start difference. First operand 428 states and 589 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-13 15:22:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:36,845 INFO L93 Difference]: Finished difference Result 857 states and 1182 transitions. [2024-11-13 15:22:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:22:36,846 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-13 15:22:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:36,848 INFO L225 Difference]: With dead ends: 857 [2024-11-13 15:22:36,849 INFO L226 Difference]: Without dead ends: 433 [2024-11-13 15:22:36,850 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-13 15:22:36,851 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 15 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:36,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3028 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:22:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-13 15:22:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 432. [2024-11-13 15:22:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 409 states have (on average 1.3789731051344742) internal successors, (564), 413 states have internal predecessors, (564), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 594 transitions. [2024-11-13 15:22:36,877 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 594 transitions. Word has length 67 [2024-11-13 15:22:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:36,877 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 594 transitions. [2024-11-13 15:22:36,877 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-13 15:22:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 594 transitions. [2024-11-13 15:22:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 15:22:36,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:36,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:22:36,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:22:36,883 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-13 15:22:36,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash -460922132, now seen corresponding path program 1 times [2024-11-13 15:22:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:36,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370456639] [2024-11-13 15:22:36,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:36,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:37,293 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-13 15:22:37,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:37,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370456639] [2024-11-13 15:22:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370456639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:37,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:37,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:22:37,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399292814] [2024-11-13 15:22:37,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:37,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:22:37,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:37,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:22:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:22:37,295 INFO L87 Difference]: Start difference. First operand 432 states and 594 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-13 15:22:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:37,474 INFO L93 Difference]: Finished difference Result 860 states and 1184 transitions. [2024-11-13 15:22:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:22:37,474 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-13 15:22:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:37,478 INFO L225 Difference]: With dead ends: 860 [2024-11-13 15:22:37,478 INFO L226 Difference]: Without dead ends: 432 [2024-11-13 15:22:37,481 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-13 15:22:37,481 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 17 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1578 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-13 15:22:37,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1578 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:22:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-13 15:22:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-11-13 15:22:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 409 states have (on average 1.3765281173594133) internal successors, (563), 413 states have internal predecessors, (563), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 593 transitions. [2024-11-13 15:22:37,506 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 593 transitions. Word has length 67 [2024-11-13 15:22:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:37,507 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 593 transitions. [2024-11-13 15:22:37,507 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-13 15:22:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 593 transitions. [2024-11-13 15:22:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 15:22:37,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:37,508 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-13 15:22:37,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:22:37,508 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-13 15:22:37,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash 706848795, now seen corresponding path program 1 times [2024-11-13 15:22:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023651997] [2024-11-13 15:22:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:38,141 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-13 15:22:38,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:38,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023651997] [2024-11-13 15:22:38,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023651997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:38,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:22:38,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441086901] [2024-11-13 15:22:38,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:38,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:22:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:38,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:22:38,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:22:38,143 INFO L87 Difference]: Start difference. First operand 432 states and 593 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-13 15:22:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:38,868 INFO L93 Difference]: Finished difference Result 873 states and 1203 transitions. [2024-11-13 15:22:38,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:22:38,869 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-13 15:22:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:38,871 INFO L225 Difference]: With dead ends: 873 [2024-11-13 15:22:38,871 INFO L226 Difference]: Without dead ends: 445 [2024-11-13 15:22:38,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:22:38,874 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 34 mSDsluCounter, 3526 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4085 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.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:38,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4085 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:22:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-13 15:22:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 442. [2024-11-13 15:22:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 419 states have (on average 1.3770883054892602) internal successors, (577), 423 states have internal predecessors, (577), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 607 transitions. [2024-11-13 15:22:38,897 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 607 transitions. Word has length 68 [2024-11-13 15:22:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:38,899 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 607 transitions. [2024-11-13 15:22:38,900 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-13 15:22:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 607 transitions. [2024-11-13 15:22:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 15:22:38,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:38,901 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-13 15:22:38,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:22:38,901 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-13 15:22:38,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1975447500, now seen corresponding path program 1 times [2024-11-13 15:22:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219350461] [2024-11-13 15:22:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:39,592 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-13 15:22:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219350461] [2024-11-13 15:22:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219350461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:39,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:39,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:22:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586240768] [2024-11-13 15:22:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:39,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:22:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:39,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:22:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:22:39,594 INFO L87 Difference]: Start difference. First operand 442 states and 607 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-13 15:22:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:40,257 INFO L93 Difference]: Finished difference Result 883 states and 1215 transitions. [2024-11-13 15:22:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:22:40,258 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-13 15:22:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:40,261 INFO L225 Difference]: With dead ends: 883 [2024-11-13 15:22:40,261 INFO L226 Difference]: Without dead ends: 445 [2024-11-13 15:22:40,262 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-13 15:22:40,263 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 27 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3577 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.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:40,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3577 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:22:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-13 15:22:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2024-11-13 15:22:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 422 states have (on average 1.3744075829383886) internal successors, (580), 426 states have internal predecessors, (580), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 610 transitions. [2024-11-13 15:22:40,282 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 610 transitions. Word has length 68 [2024-11-13 15:22:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:40,283 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 610 transitions. [2024-11-13 15:22:40,283 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-13 15:22:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 610 transitions. [2024-11-13 15:22:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 15:22:40,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:40,284 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-13 15:22:40,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:22:40,285 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-13 15:22:40,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash -814148236, now seen corresponding path program 1 times [2024-11-13 15:22:40,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:40,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466482838] [2024-11-13 15:22:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:40,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:40,617 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-13 15:22:40,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:40,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466482838] [2024-11-13 15:22:40,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466482838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:40,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:40,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:22:40,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017151267] [2024-11-13 15:22:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:40,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:22:40,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:40,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:22:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:22:40,620 INFO L87 Difference]: Start difference. First operand 445 states and 610 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-13 15:22:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:40,968 INFO L93 Difference]: Finished difference Result 889 states and 1221 transitions. [2024-11-13 15:22:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:22:40,969 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-13 15:22:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:40,972 INFO L225 Difference]: With dead ends: 889 [2024-11-13 15:22:40,972 INFO L226 Difference]: Without dead ends: 448 [2024-11-13 15:22:40,973 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-13 15:22:40,974 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 8 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:40,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2072 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:22:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-13 15:22:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2024-11-13 15:22:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 425 states have (on average 1.371764705882353) internal successors, (583), 429 states have internal predecessors, (583), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 613 transitions. [2024-11-13 15:22:40,995 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 613 transitions. Word has length 68 [2024-11-13 15:22:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:40,996 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 613 transitions. [2024-11-13 15:22:40,996 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-13 15:22:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 613 transitions. [2024-11-13 15:22:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 15:22:40,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:40,999 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-13 15:22:40,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:22:40,999 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-13 15:22:40,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1436413787, now seen corresponding path program 1 times [2024-11-13 15:22:41,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:41,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861411931] [2024-11-13 15:22:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:41,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:41,850 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-13 15:22:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861411931] [2024-11-13 15:22:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861411931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:41,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:22:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106909026] [2024-11-13 15:22:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:41,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:22:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:22:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:22:41,853 INFO L87 Difference]: Start difference. First operand 448 states and 613 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-13 15:22:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:43,214 INFO L93 Difference]: Finished difference Result 1308 states and 1799 transitions. [2024-11-13 15:22:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:22:43,215 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-13 15:22:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:43,219 INFO L225 Difference]: With dead ends: 1308 [2024-11-13 15:22:43,219 INFO L226 Difference]: Without dead ends: 864 [2024-11-13 15:22:43,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:22:43,221 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 687 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:43,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 3438 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:22:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-13 15:22:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 486. [2024-11-13 15:22:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 463 states have (on average 1.349892008639309) internal successors, (625), 467 states have internal predecessors, (625), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 655 transitions. [2024-11-13 15:22:43,244 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 655 transitions. Word has length 69 [2024-11-13 15:22:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:43,244 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 655 transitions. [2024-11-13 15:22:43,244 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-13 15:22:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 655 transitions. [2024-11-13 15:22:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 15:22:43,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:43,245 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-13 15:22:43,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:22:43,246 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-13 15:22:43,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2121823057, now seen corresponding path program 1 times [2024-11-13 15:22:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601094666] [2024-11-13 15:22:43,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:43,573 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-13 15:22:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601094666] [2024-11-13 15:22:43,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601094666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:43,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:43,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:22:43,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055354904] [2024-11-13 15:22:43,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:43,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:22:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:43,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:22:43,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:22:43,576 INFO L87 Difference]: Start difference. First operand 486 states and 655 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-13 15:22:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:44,030 INFO L93 Difference]: Finished difference Result 935 states and 1272 transitions. [2024-11-13 15:22:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:22:44,030 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-13 15:22:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:44,034 INFO L225 Difference]: With dead ends: 935 [2024-11-13 15:22:44,034 INFO L226 Difference]: Without dead ends: 491 [2024-11-13 15:22:44,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:22:44,035 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 13 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3034 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.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:44,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3034 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:22:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-13 15:22:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 486. [2024-11-13 15:22:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 463 states have (on average 1.349892008639309) internal successors, (625), 467 states have internal predecessors, (625), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 655 transitions. [2024-11-13 15:22:44,060 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 655 transitions. Word has length 69 [2024-11-13 15:22:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:44,060 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 655 transitions. [2024-11-13 15:22:44,061 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-13 15:22:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 655 transitions. [2024-11-13 15:22:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 15:22:44,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:44,062 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-13 15:22:44,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:22:44,062 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-13 15:22:44,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash -340510784, now seen corresponding path program 1 times [2024-11-13 15:22:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692612259] [2024-11-13 15:22:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:44,422 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-13 15:22:44,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:44,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692612259] [2024-11-13 15:22:44,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692612259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:44,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:44,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:22:44,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677149770] [2024-11-13 15:22:44,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:44,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:22:44,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:44,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:22:44,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:22:44,425 INFO L87 Difference]: Start difference. First operand 486 states and 655 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-13 15:22:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:44,882 INFO L93 Difference]: Finished difference Result 940 states and 1278 transitions. [2024-11-13 15:22:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:22:44,885 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-13 15:22:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:44,888 INFO L225 Difference]: With dead ends: 940 [2024-11-13 15:22:44,888 INFO L226 Difference]: Without dead ends: 496 [2024-11-13 15:22:44,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:22:44,890 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 20 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3617 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.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:44,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3617 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:22:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-13 15:22:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 489. [2024-11-13 15:22:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 466 states have (on average 1.349785407725322) internal successors, (629), 470 states have internal predecessors, (629), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 659 transitions. [2024-11-13 15:22:44,913 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 659 transitions. Word has length 70 [2024-11-13 15:22:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:44,913 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 659 transitions. [2024-11-13 15:22:44,914 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-13 15:22:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 659 transitions. [2024-11-13 15:22:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 15:22:44,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:44,915 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-13 15:22:44,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:22:44,915 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-13 15:22:44,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1796730020, now seen corresponding path program 1 times [2024-11-13 15:22:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068390233] [2024-11-13 15:22:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:45,361 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-13 15:22:45,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:45,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068390233] [2024-11-13 15:22:45,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068390233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:45,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:45,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:22:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880743892] [2024-11-13 15:22:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:45,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:22:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:22:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:22:45,364 INFO L87 Difference]: Start difference. First operand 489 states and 659 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-13 15:22:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:46,207 INFO L93 Difference]: Finished difference Result 958 states and 1298 transitions. [2024-11-13 15:22:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:22:46,208 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-13 15:22:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:46,211 INFO L225 Difference]: With dead ends: 958 [2024-11-13 15:22:46,211 INFO L226 Difference]: Without dead ends: 511 [2024-11-13 15:22:46,212 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-13 15:22:46,214 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 38 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4062 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:46,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4062 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:22:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-13 15:22:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 489. [2024-11-13 15:22:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 466 states have (on average 1.349785407725322) internal successors, (629), 470 states have internal predecessors, (629), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 659 transitions. [2024-11-13 15:22:46,242 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 659 transitions. Word has length 70 [2024-11-13 15:22:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:46,242 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 659 transitions. [2024-11-13 15:22:46,242 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-13 15:22:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 659 transitions. [2024-11-13 15:22:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:22:46,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:46,243 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-13 15:22:46,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:22:46,244 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-13 15:22:46,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1077501215, now seen corresponding path program 1 times [2024-11-13 15:22:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:46,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111210644] [2024-11-13 15:22:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:46,720 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-13 15:22:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111210644] [2024-11-13 15:22:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111210644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:46,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:46,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:22:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074783149] [2024-11-13 15:22:46,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:46,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:22:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:22:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:22:46,723 INFO L87 Difference]: Start difference. First operand 489 states and 659 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-13 15:22:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:47,458 INFO L93 Difference]: Finished difference Result 952 states and 1295 transitions. [2024-11-13 15:22:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:22:47,458 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-13 15:22:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:47,463 INFO L225 Difference]: With dead ends: 952 [2024-11-13 15:22:47,463 INFO L226 Difference]: Without dead ends: 505 [2024-11-13 15:22:47,464 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-13 15:22:47,465 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 23 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:47,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4106 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:22:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-13 15:22:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 499. [2024-11-13 15:22:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 476 states have (on average 1.346638655462185) internal successors, (641), 480 states have internal predecessors, (641), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 671 transitions. [2024-11-13 15:22:47,495 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 671 transitions. Word has length 71 [2024-11-13 15:22:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:47,496 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 671 transitions. [2024-11-13 15:22:47,496 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-13 15:22:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 671 transitions. [2024-11-13 15:22:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:22:47,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:47,497 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-13 15:22:47,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:22:47,498 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-13 15:22:47,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:47,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1409403963, now seen corresponding path program 1 times [2024-11-13 15:22:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972041032] [2024-11-13 15:22:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:48,044 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-13 15:22:48,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:48,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972041032] [2024-11-13 15:22:48,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972041032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:48,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:48,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:22:48,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138008298] [2024-11-13 15:22:48,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:48,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:22:48,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:48,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:22:48,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:22:48,047 INFO L87 Difference]: Start difference. First operand 499 states and 671 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-13 15:22:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:48,572 INFO L93 Difference]: Finished difference Result 959 states and 1299 transitions. [2024-11-13 15:22:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:22:48,573 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-13 15:22:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:48,577 INFO L225 Difference]: With dead ends: 959 [2024-11-13 15:22:48,577 INFO L226 Difference]: Without dead ends: 502 [2024-11-13 15:22:48,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:22:48,579 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 11 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3058 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.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:48,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3058 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:22:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-13 15:22:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2024-11-13 15:22:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 476 states have (on average 1.3445378151260505) internal successors, (640), 480 states have internal predecessors, (640), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 670 transitions. [2024-11-13 15:22:48,611 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 670 transitions. Word has length 71 [2024-11-13 15:22:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:48,612 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 670 transitions. [2024-11-13 15:22:48,613 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-13 15:22:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 670 transitions. [2024-11-13 15:22:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:22:48,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:48,614 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-13 15:22:48,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:22:48,617 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-13 15:22:48,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1272892332, now seen corresponding path program 1 times [2024-11-13 15:22:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:48,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3937486] [2024-11-13 15:22:48,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:48,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:48,981 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-13 15:22:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:48,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3937486] [2024-11-13 15:22:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3937486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:48,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:22:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642339217] [2024-11-13 15:22:48,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:22:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:48,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:22:48,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:22:48,985 INFO L87 Difference]: Start difference. First operand 499 states and 670 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-13 15:22:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:49,536 INFO L93 Difference]: Finished difference Result 959 states and 1299 transitions. [2024-11-13 15:22:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:22:49,537 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-13 15:22:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:49,540 INFO L225 Difference]: With dead ends: 959 [2024-11-13 15:22:49,540 INFO L226 Difference]: Without dead ends: 502 [2024-11-13 15:22:49,542 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-13 15:22:49,543 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 8 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3017 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-13 15:22:49,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3017 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:22:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-13 15:22:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2024-11-13 15:22:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 479 states have (on average 1.3423799582463465) internal successors, (643), 483 states have internal predecessors, (643), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 673 transitions. [2024-11-13 15:22:49,570 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 673 transitions. Word has length 71 [2024-11-13 15:22:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:49,571 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 673 transitions. [2024-11-13 15:22:49,571 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-13 15:22:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 673 transitions. [2024-11-13 15:22:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:22:49,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:49,572 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-13 15:22:49,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:22:49,573 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-13 15:22:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1387510597, now seen corresponding path program 1 times [2024-11-13 15:22:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:49,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552944416] [2024-11-13 15:22:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:50,076 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-13 15:22:50,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:50,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552944416] [2024-11-13 15:22:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552944416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:50,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:50,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:22:50,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289538953] [2024-11-13 15:22:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:50,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:22:50,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:50,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:22:50,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:22:50,079 INFO L87 Difference]: Start difference. First operand 502 states and 673 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-13 15:22:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:50,840 INFO L93 Difference]: Finished difference Result 978 states and 1323 transitions. [2024-11-13 15:22:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:22:50,841 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-13 15:22:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:50,844 INFO L225 Difference]: With dead ends: 978 [2024-11-13 15:22:50,844 INFO L226 Difference]: Without dead ends: 518 [2024-11-13 15:22:50,846 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-13 15:22:50,846 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 17 mSDsluCounter, 4004 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4555 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.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:50,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4555 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:22:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-13 15:22:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 505. [2024-11-13 15:22:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 482 states have (on average 1.342323651452282) internal successors, (647), 486 states have internal predecessors, (647), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 677 transitions. [2024-11-13 15:22:50,874 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 677 transitions. Word has length 71 [2024-11-13 15:22:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:50,875 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 677 transitions. [2024-11-13 15:22:50,875 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-13 15:22:50,875 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 677 transitions. [2024-11-13 15:22:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:22:50,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:50,881 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-13 15:22:50,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:22:50,881 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-13 15:22:50,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:50,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1008770813, now seen corresponding path program 1 times [2024-11-13 15:22:50,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:50,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227503427] [2024-11-13 15:22:50,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:51,459 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-13 15:22:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227503427] [2024-11-13 15:22:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227503427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:51,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:22:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607998843] [2024-11-13 15:22:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:51,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:22:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:22:51,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:22:51,463 INFO L87 Difference]: Start difference. First operand 505 states and 677 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-13 15:22:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:52,177 INFO L93 Difference]: Finished difference Result 980 states and 1326 transitions. [2024-11-13 15:22:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:22:52,177 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-13 15:22:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:52,181 INFO L225 Difference]: With dead ends: 980 [2024-11-13 15:22:52,181 INFO L226 Difference]: Without dead ends: 517 [2024-11-13 15:22:52,182 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-13 15:22:52,183 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 13 mSDsluCounter, 3504 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4066 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.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:52,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4066 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:22:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-13 15:22:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 509. [2024-11-13 15:22:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 486 states have (on average 1.3415637860082306) internal successors, (652), 490 states have internal predecessors, (652), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 682 transitions. [2024-11-13 15:22:52,209 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 682 transitions. Word has length 72 [2024-11-13 15:22:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:52,210 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 682 transitions. [2024-11-13 15:22:52,210 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-13 15:22:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 682 transitions. [2024-11-13 15:22:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:22:52,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:52,212 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-13 15:22:52,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:22:52,212 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-13 15:22:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1951188577, now seen corresponding path program 1 times [2024-11-13 15:22:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556926722] [2024-11-13 15:22:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:22:52,714 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-13 15:22:52,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:22:52,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556926722] [2024-11-13 15:22:52,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556926722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:22:52,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:22:52,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:22:52,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764260957] [2024-11-13 15:22:52,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:22:52,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:22:52,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:22:52,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:22:52,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:22:52,716 INFO L87 Difference]: Start difference. First operand 509 states and 682 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-13 15:22:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:22:53,538 INFO L93 Difference]: Finished difference Result 997 states and 1343 transitions. [2024-11-13 15:22:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:22:53,539 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-13 15:22:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:22:53,543 INFO L225 Difference]: With dead ends: 997 [2024-11-13 15:22:53,543 INFO L226 Difference]: Without dead ends: 530 [2024-11-13 15:22:53,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:22:53,545 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 34 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4062 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:22:53,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4062 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:22:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-13 15:22:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 506. [2024-11-13 15:22:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 483 states have (on average 1.3436853002070392) internal successors, (649), 487 states have internal predecessors, (649), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:22:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 679 transitions. [2024-11-13 15:22:53,571 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 679 transitions. Word has length 72 [2024-11-13 15:22:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:22:53,571 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 679 transitions. [2024-11-13 15:22:53,571 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-13 15:22:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 679 transitions. [2024-11-13 15:22:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:22:53,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:22:53,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:22:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:22:53,573 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-13 15:22:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:22:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1740787515, now seen corresponding path program 1 times [2024-11-13 15:22:53,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:22:53,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7329750] [2024-11-13 15:22:53,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:22:53,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:22:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:10,273 WARN L286 SmtUtils]: Spent 8.02s 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-13 15:23:40,091 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:23:50,015 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-13 15:23:50,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:23:50,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7329750] [2024-11-13 15:23:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7329750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:23:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:23:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:23:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728944144] [2024-11-13 15:23:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:23:50,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:23:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:23:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:23:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=83, Unknown=5, NotChecked=0, Total=110 [2024-11-13 15:23:50,016 INFO L87 Difference]: Start difference. First operand 506 states and 679 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-13 15:23:52,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:23:56,404 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-13 15:24:00,411 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-13 15:24:04,414 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-13 15:24:08,421 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-13 15:24:10,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:24:14,762 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-13 15:24:18,769 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-13 15:24:22,773 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-13 15:24:25,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:24:29,224 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-13 15:24:33,227 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-13 15:24:35,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:24:39,150 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-13 15:24:42,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:24:46,778 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-13 15:24:50,785 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-13 15:24:54,790 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-13 15:24:58,803 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-13 15:25:02,808 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-13 15:25:05,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:25:07,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:25:11,233 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-13 15:25:15,236 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-13 15:25:19,240 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-13 15:25:23,248 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-13 15:25:27,253 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-13 15:25:31,265 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-13 15:25:34,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:25:38,472 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-13 15:25:42,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse0 (+ .cse2 |c_ULTIMATE.start_main_~_ha_hashv~0#1|))) (and (<= 2 (mod |c_ULTIMATE.start_main_~_ha_hashv~0#1| 4294967296)) (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 (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse2 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse1)) 4294967296)) (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0)))) is different from false [2024-11-13 15:25:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:43,833 INFO L93 Difference]: Finished difference Result 997 states and 1354 transitions. [2024-11-13 15:25:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:25:43,834 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-13 15:25:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:43,837 INFO L225 Difference]: With dead ends: 997 [2024-11-13 15:25:43,838 INFO L226 Difference]: Without dead ends: 533 [2024-11-13 15:25:43,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=24, Invalid=84, Unknown=6, NotChecked=18, Total=132 [2024-11-13 15:25:43,839 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 42 mSDsluCounter, 3987 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 2 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4550 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 109.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:43,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4550 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 779 Invalid, 22 Unknown, 20 Unchecked, 109.7s Time] [2024-11-13 15:25:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-13 15:25:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 512. [2024-11-13 15:25:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 489 states have (on average 1.343558282208589) internal successors, (657), 493 states have internal predecessors, (657), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:25:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 687 transitions. [2024-11-13 15:25:43,862 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 687 transitions. Word has length 72 [2024-11-13 15:25:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:43,863 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 687 transitions. [2024-11-13 15:25:43,863 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-13 15:25:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 687 transitions. [2024-11-13 15:25:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:25:43,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:43,864 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-13 15:25:43,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:25:43,864 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-13 15:25:43,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 919802864, now seen corresponding path program 1 times [2024-11-13 15:25:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:43,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390604438] [2024-11-13 15:25:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:44,306 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-13 15:25:44,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390604438] [2024-11-13 15:25:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390604438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:44,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:44,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:25:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19359809] [2024-11-13 15:25:44,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:25:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:44,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:25:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:25:44,308 INFO L87 Difference]: Start difference. First operand 512 states and 687 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-13 15:25:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:45,219 INFO L93 Difference]: Finished difference Result 995 states and 1346 transitions. [2024-11-13 15:25:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:25:45,220 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-13 15:25:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:45,224 INFO L225 Difference]: With dead ends: 995 [2024-11-13 15:25:45,224 INFO L226 Difference]: Without dead ends: 525 [2024-11-13 15:25:45,226 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-13 15:25:45,227 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 40 mSDsluCounter, 4026 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4585 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.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:45,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4585 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:25:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-13 15:25:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 515. [2024-11-13 15:25:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 492 states have (on average 1.3414634146341464) internal successors, (660), 496 states have internal predecessors, (660), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:25:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 690 transitions. [2024-11-13 15:25:45,252 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 690 transitions. Word has length 72 [2024-11-13 15:25:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:45,253 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 690 transitions. [2024-11-13 15:25:45,253 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-13 15:25:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 690 transitions. [2024-11-13 15:25:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:25:45,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:45,254 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-13 15:25:45,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:25:45,255 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-13 15:25:45,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash -114725657, now seen corresponding path program 1 times [2024-11-13 15:25:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198107838] [2024-11-13 15:25:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:46,018 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-13 15:25:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198107838] [2024-11-13 15:25:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198107838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:46,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:46,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:25:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206245360] [2024-11-13 15:25:46,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:46,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:25:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:46,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:25:46,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:25:46,021 INFO L87 Difference]: Start difference. First operand 515 states and 690 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-13 15:25:50,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:25:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:51,450 INFO L93 Difference]: Finished difference Result 1005 states and 1353 transitions. [2024-11-13 15:25:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:25:51,454 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-13 15:25:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:51,458 INFO L225 Difference]: With dead ends: 1005 [2024-11-13 15:25:51,458 INFO L226 Difference]: Without dead ends: 532 [2024-11-13 15:25:51,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:25:51,461 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 45 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:51,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4529 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-13 15:25:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-13 15:25:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 516. [2024-11-13 15:25:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3407707910750508) internal successors, (661), 497 states have internal predecessors, (661), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:25:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 691 transitions. [2024-11-13 15:25:51,487 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 691 transitions. Word has length 72 [2024-11-13 15:25:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:51,487 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 691 transitions. [2024-11-13 15:25:51,488 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-13 15:25:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 691 transitions. [2024-11-13 15:25:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:25:51,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:51,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:25:51,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:25:51,489 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-13 15:25:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash -224165720, now seen corresponding path program 1 times [2024-11-13 15:25:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:51,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935675024] [2024-11-13 15:25:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:25:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935675024] [2024-11-13 15:25:52,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935675024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:52,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:52,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:25:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159262581] [2024-11-13 15:25:52,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:52,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:25:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:52,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:25:52,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:25:52,061 INFO L87 Difference]: Start difference. First operand 516 states and 691 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-13 15:25:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:53,318 INFO L93 Difference]: Finished difference Result 1002 states and 1354 transitions. [2024-11-13 15:25:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:25:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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 73 [2024-11-13 15:25:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:53,322 INFO L225 Difference]: With dead ends: 1002 [2024-11-13 15:25:53,323 INFO L226 Difference]: Without dead ends: 528 [2024-11-13 15:25:53,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:25:53,325 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 16 mSDsluCounter, 4990 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5552 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:53,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5552 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 15:25:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-13 15:25:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 523. [2024-11-13 15:25:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 500 states have (on average 1.34) internal successors, (670), 504 states have internal predecessors, (670), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:25:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 700 transitions. [2024-11-13 15:25:53,348 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 700 transitions. Word has length 73 [2024-11-13 15:25:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:53,349 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 700 transitions. [2024-11-13 15:25:53,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-13 15:25:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 700 transitions. [2024-11-13 15:25:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:25:53,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:53,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:25:53,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 15:25:53,351 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:25:53,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1327088318, now seen corresponding path program 1 times [2024-11-13 15:25:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:53,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132173254] [2024-11-13 15:25:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:53,933 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-13 15:25:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:53,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132173254] [2024-11-13 15:25:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132173254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:53,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:53,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:25:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101996177] [2024-11-13 15:25:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:53,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:25:53,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:53,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:25:53,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:25:53,936 INFO L87 Difference]: Start difference. First operand 523 states and 700 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-13 15:25:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:54,997 INFO L93 Difference]: Finished difference Result 1020 states and 1379 transitions. [2024-11-13 15:25:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:25:54,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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 73 [2024-11-13 15:25:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:55,001 INFO L225 Difference]: With dead ends: 1020 [2024-11-13 15:25:55,002 INFO L226 Difference]: Without dead ends: 539 [2024-11-13 15:25:55,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:25:55,004 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 18 mSDsluCounter, 4986 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5543 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:55,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5543 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:25:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-13 15:25:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 524. [2024-11-13 15:25:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.3393213572854292) internal successors, (671), 505 states have internal predecessors, (671), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:25:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 701 transitions. [2024-11-13 15:25:55,028 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 701 transitions. Word has length 73 [2024-11-13 15:25:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:55,029 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 701 transitions. [2024-11-13 15:25:55,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 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-13 15:25:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 701 transitions. [2024-11-13 15:25:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:25:55,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:55,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:25:55,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 15:25:55,031 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:25:55,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1608870112, now seen corresponding path program 1 times [2024-11-13 15:25:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:55,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711755842] [2024-11-13 15:25:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:55,468 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-13 15:25:55,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:55,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711755842] [2024-11-13 15:25:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711755842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:55,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:25:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721441202] [2024-11-13 15:25:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:55,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:25:55,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:25:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:25:55,470 INFO L87 Difference]: Start difference. First operand 524 states and 701 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-13 15:25:56,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:25:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:57,333 INFO L93 Difference]: Finished difference Result 1016 states and 1370 transitions. [2024-11-13 15:25:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:25:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 73 [2024-11-13 15:25:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:57,337 INFO L225 Difference]: With dead ends: 1016 [2024-11-13 15:25:57,337 INFO L226 Difference]: Without dead ends: 534 [2024-11-13 15:25:57,338 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-13 15:25:57,339 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 12 mSDsluCounter, 4020 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:57,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4585 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:25:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-13 15:25:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 524. [2024-11-13 15:25:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.3393213572854292) internal successors, (671), 505 states have internal predecessors, (671), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:25:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 701 transitions. [2024-11-13 15:25:57,363 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 701 transitions. Word has length 73 [2024-11-13 15:25:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:57,363 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 701 transitions. [2024-11-13 15:25:57,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-13 15:25:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 701 transitions. [2024-11-13 15:25:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:25:57,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:57,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:25:57,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:25:57,365 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:25:57,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1734039332, now seen corresponding path program 1 times [2024-11-13 15:25:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:57,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789313094] [2024-11-13 15:25:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:58,034 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-13 15:25:58,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789313094] [2024-11-13 15:25:58,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789313094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:58,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:58,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:25:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487514681] [2024-11-13 15:25:58,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:58,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:25:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:58,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:25:58,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:25:58,037 INFO L87 Difference]: Start difference. First operand 524 states and 701 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-13 15:25:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:59,473 INFO L93 Difference]: Finished difference Result 1038 states and 1399 transitions. [2024-11-13 15:25:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:25:59,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 73 [2024-11-13 15:25:59,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:59,477 INFO L225 Difference]: With dead ends: 1038 [2024-11-13 15:25:59,477 INFO L226 Difference]: Without dead ends: 556 [2024-11-13 15:25:59,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:25:59,479 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 47 mSDsluCounter, 5515 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 6069 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:59,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 6069 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 15:25:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-13 15:25:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 533. [2024-11-13 15:25:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 510 states have (on average 1.3392156862745097) internal successors, (683), 514 states have internal predecessors, (683), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:25:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 713 transitions. [2024-11-13 15:25:59,501 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 713 transitions. Word has length 73 [2024-11-13 15:25:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:59,501 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 713 transitions. [2024-11-13 15:25:59,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-13 15:25:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 713 transitions. [2024-11-13 15:25:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:25:59,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:59,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:25:59,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 15:25:59,503 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:25:59,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash -887203472, now seen corresponding path program 1 times [2024-11-13 15:25:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:59,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512820599] [2024-11-13 15:25:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:38,341 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-13 15:26:38,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:26:38,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512820599] [2024-11-13 15:26:38,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512820599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:38,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:38,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:26:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335688818] [2024-11-13 15:26:38,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:38,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:26:38,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:26:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:26:38,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:26:38,346 INFO L87 Difference]: Start difference. First operand 533 states and 713 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-13 15:26:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:41,521 INFO L93 Difference]: Finished difference Result 1094 states and 1479 transitions. [2024-11-13 15:26:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:26:41,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 73 [2024-11-13 15:26:41,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:41,525 INFO L225 Difference]: With dead ends: 1094 [2024-11-13 15:26:41,525 INFO L226 Difference]: Without dead ends: 603 [2024-11-13 15:26:41,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:26:41,528 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 110 mSDsluCounter, 4970 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 5592 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:41,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 5592 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 15:26:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-13 15:26:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 534. [2024-11-13 15:26:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 511 states have (on average 1.340508806262231) internal successors, (685), 515 states have internal predecessors, (685), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:26:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 715 transitions. [2024-11-13 15:26:41,552 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 715 transitions. Word has length 73 [2024-11-13 15:26:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:41,553 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 715 transitions. [2024-11-13 15:26:41,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-13 15:26:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 715 transitions. [2024-11-13 15:26:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:26:41,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:41,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:26:41,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 15:26:41,555 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:26:41,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1173239044, now seen corresponding path program 1 times [2024-11-13 15:26:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:26:41,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791727406] [2024-11-13 15:26:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:26:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:45,291 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-13 15:26:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:26:45,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791727406] [2024-11-13 15:26:45,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791727406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:45,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:45,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:26:45,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305332330] [2024-11-13 15:26:45,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:45,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:26:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:26:45,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:26:45,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:26:45,293 INFO L87 Difference]: Start difference. First operand 534 states and 715 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-13 15:26:49,851 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-13 15:26:53,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:26:54,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:26:57,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:26:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:58,994 INFO L93 Difference]: Finished difference Result 1051 states and 1419 transitions. [2024-11-13 15:26:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:26:58,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 73 [2024-11-13 15:26:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:58,998 INFO L225 Difference]: With dead ends: 1051 [2024-11-13 15:26:58,998 INFO L226 Difference]: Without dead ends: 559 [2024-11-13 15:26:58,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:26:59,000 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 82 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:59,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 4038 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 683 Invalid, 1 Unknown, 0 Unchecked, 13.6s Time] [2024-11-13 15:26:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-13 15:26:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 534. [2024-11-13 15:26:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 511 states have (on average 1.340508806262231) internal successors, (685), 515 states have internal predecessors, (685), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:26:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 715 transitions. [2024-11-13 15:26:59,026 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 715 transitions. Word has length 73 [2024-11-13 15:26:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:59,027 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 715 transitions. [2024-11-13 15:26:59,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-13 15:26:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 715 transitions. [2024-11-13 15:26:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:26:59,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:59,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:26:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 15:26:59,029 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:26:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1278573464, now seen corresponding path program 1 times [2024-11-13 15:26:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:26:59,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282459945] [2024-11-13 15:26:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:26:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:59,295 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-13 15:26:59,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:26:59,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282459945] [2024-11-13 15:26:59,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282459945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:59,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:59,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:26:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424768682] [2024-11-13 15:26:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:59,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:26:59,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:26:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:26:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:26:59,298 INFO L87 Difference]: Start difference. First operand 534 states and 715 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-13 15:26:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:59,916 INFO L93 Difference]: Finished difference Result 1062 states and 1428 transitions. [2024-11-13 15:26:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:26:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 73 [2024-11-13 15:26:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:59,922 INFO L225 Difference]: With dead ends: 1062 [2024-11-13 15:26:59,923 INFO L226 Difference]: Without dead ends: 570 [2024-11-13 15:26:59,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:26:59,924 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 100 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:59,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2566 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:26:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-13 15:26:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 530. [2024-11-13 15:26:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 507 states have (on average 1.3431952662721893) internal successors, (681), 511 states have internal predecessors, (681), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:26:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 711 transitions. [2024-11-13 15:26:59,949 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 711 transitions. Word has length 73 [2024-11-13 15:26:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:59,949 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 711 transitions. [2024-11-13 15:26:59,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-13 15:26:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 711 transitions. [2024-11-13 15:26:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:26:59,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:59,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:26:59,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 15:26:59,951 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:26:59,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1360931232, now seen corresponding path program 1 times [2024-11-13 15:26:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:26:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614620304] [2024-11-13 15:26:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:00,326 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-13 15:27:00,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:00,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614620304] [2024-11-13 15:27:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614620304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:00,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:00,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:27:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069404720] [2024-11-13 15:27:00,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:00,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:27:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:27:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:27:00,329 INFO L87 Difference]: Start difference. First operand 530 states and 711 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-13 15:27:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:01,021 INFO L93 Difference]: Finished difference Result 1032 states and 1393 transitions. [2024-11-13 15:27:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:27:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 73 [2024-11-13 15:27:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:01,025 INFO L225 Difference]: With dead ends: 1032 [2024-11-13 15:27:01,025 INFO L226 Difference]: Without dead ends: 535 [2024-11-13 15:27:01,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:27:01,027 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 37 mSDsluCounter, 3036 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3602 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:01,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3602 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:27:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-13 15:27:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 527. [2024-11-13 15:27:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 504 states have (on average 1.3432539682539681) internal successors, (677), 508 states have internal predecessors, (677), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 707 transitions. [2024-11-13 15:27:01,047 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 707 transitions. Word has length 73 [2024-11-13 15:27:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 707 transitions. [2024-11-13 15:27:01,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-13 15:27:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 707 transitions. [2024-11-13 15:27:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:27:01,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:01,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:27:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 15:27:01,049 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1659020670, now seen corresponding path program 1 times [2024-11-13 15:27:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:01,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39440387] [2024-11-13 15:27:01,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:01,343 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-13 15:27:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39440387] [2024-11-13 15:27:01,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39440387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:01,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:01,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:27:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495837522] [2024-11-13 15:27:01,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:01,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:27:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:27:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:27:01,346 INFO L87 Difference]: Start difference. First operand 527 states and 707 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-13 15:27:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:01,875 INFO L93 Difference]: Finished difference Result 1025 states and 1382 transitions. [2024-11-13 15:27:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:27:01,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 73 [2024-11-13 15:27:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:01,879 INFO L225 Difference]: With dead ends: 1025 [2024-11-13 15:27:01,879 INFO L226 Difference]: Without dead ends: 531 [2024-11-13 15:27:01,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:27:01,881 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 53 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:01,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3109 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:27:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-13 15:27:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 524. [2024-11-13 15:27:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.343313373253493) internal successors, (673), 505 states have internal predecessors, (673), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 703 transitions. [2024-11-13 15:27:01,903 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 703 transitions. Word has length 73 [2024-11-13 15:27:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:01,904 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 703 transitions. [2024-11-13 15:27:01,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-13 15:27:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 703 transitions. [2024-11-13 15:27:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:01,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:01,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:27:01,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 15:27:01,906 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1776919823, now seen corresponding path program 1 times [2024-11-13 15:27:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595727776] [2024-11-13 15:27:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:02,753 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-13 15:27:02,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:02,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595727776] [2024-11-13 15:27:02,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595727776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:02,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:02,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:27:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111796150] [2024-11-13 15:27:02,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:02,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:27:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:02,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:27:02,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:27:02,756 INFO L87 Difference]: Start difference. First operand 524 states and 703 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-13 15:27:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:04,011 INFO L93 Difference]: Finished difference Result 1029 states and 1389 transitions. [2024-11-13 15:27:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:27:04,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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 74 [2024-11-13 15:27:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:04,014 INFO L225 Difference]: With dead ends: 1029 [2024-11-13 15:27:04,014 INFO L226 Difference]: Without dead ends: 538 [2024-11-13 15:27:04,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:27:04,016 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 66 mSDsluCounter, 4963 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 5520 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:04,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 5520 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:27:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-13 15:27:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 524. [2024-11-13 15:27:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.341317365269461) internal successors, (672), 505 states have internal predecessors, (672), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 702 transitions. [2024-11-13 15:27:04,046 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 702 transitions. Word has length 74 [2024-11-13 15:27:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:04,047 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 702 transitions. [2024-11-13 15:27:04,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-13 15:27:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 702 transitions. [2024-11-13 15:27:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:04,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:04,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:27:04,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 15:27:04,049 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:04,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash 257643496, now seen corresponding path program 1 times [2024-11-13 15:27:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:04,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477317701] [2024-11-13 15:27:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:04,826 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-13 15:27:04,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477317701] [2024-11-13 15:27:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477317701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:04,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:27:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648056936] [2024-11-13 15:27:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:04,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:27:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:27:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:27:04,828 INFO L87 Difference]: Start difference. First operand 524 states and 702 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-13 15:27:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:05,614 INFO L93 Difference]: Finished difference Result 1011 states and 1364 transitions. [2024-11-13 15:27:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:27:05,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 74 [2024-11-13 15:27:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:05,617 INFO L225 Difference]: With dead ends: 1011 [2024-11-13 15:27:05,617 INFO L226 Difference]: Without dead ends: 520 [2024-11-13 15:27:05,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:27:05,618 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 12 mSDsluCounter, 3967 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4525 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:05,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4525 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:27:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-13 15:27:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 510. [2024-11-13 15:27:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 487 states have (on average 1.3470225872689938) internal successors, (656), 491 states have internal predecessors, (656), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 686 transitions. [2024-11-13 15:27:05,638 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 686 transitions. Word has length 74 [2024-11-13 15:27:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:05,639 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 686 transitions. [2024-11-13 15:27:05,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-13 15:27:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 686 transitions. [2024-11-13 15:27:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:05,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:05,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:27:05,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 15:27:05,641 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2072964239, now seen corresponding path program 1 times [2024-11-13 15:27:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941039434] [2024-11-13 15:27:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:06,138 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-13 15:27:06,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:06,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941039434] [2024-11-13 15:27:06,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941039434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:06,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:06,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:27:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842847466] [2024-11-13 15:27:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:06,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:27:06,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:06,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:27:06,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:27:06,141 INFO L87 Difference]: Start difference. First operand 510 states and 686 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-13 15:27:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:06,747 INFO L93 Difference]: Finished difference Result 1003 states and 1354 transitions. [2024-11-13 15:27:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:27:06,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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 74 [2024-11-13 15:27:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:06,751 INFO L225 Difference]: With dead ends: 1003 [2024-11-13 15:27:06,751 INFO L226 Difference]: Without dead ends: 526 [2024-11-13 15:27:06,752 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-13 15:27:06,753 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 13 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4088 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:06,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4088 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:27:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-13 15:27:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 521. [2024-11-13 15:27:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 498 states have (on average 1.3413654618473896) internal successors, (668), 502 states have internal predecessors, (668), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 698 transitions. [2024-11-13 15:27:06,775 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 698 transitions. Word has length 74 [2024-11-13 15:27:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:06,775 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 698 transitions. [2024-11-13 15:27:06,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-13 15:27:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 698 transitions. [2024-11-13 15:27:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:06,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:06,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, 1, 1, 1, 1, 1, 1] [2024-11-13 15:27:06,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 15:27:06,778 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:06,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1673812551, now seen corresponding path program 1 times [2024-11-13 15:27:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:06,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204628791] [2024-11-13 15:27:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:07,383 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-13 15:27:07,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:07,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204628791] [2024-11-13 15:27:07,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204628791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:07,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:07,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:27:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102824586] [2024-11-13 15:27:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:07,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:27:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:27:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:27:07,385 INFO L87 Difference]: Start difference. First operand 521 states and 698 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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-13 15:27:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:09,706 INFO L93 Difference]: Finished difference Result 1032 states and 1391 transitions. [2024-11-13 15:27:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:27:09,707 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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 74 [2024-11-13 15:27:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:09,710 INFO L225 Difference]: With dead ends: 1032 [2024-11-13 15:27:09,710 INFO L226 Difference]: Without dead ends: 544 [2024-11-13 15:27:09,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:27:09,714 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 49 mSDsluCounter, 6042 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 6606 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:09,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 6606 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 15:27:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-13 15:27:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 521. [2024-11-13 15:27:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 498 states have (on average 1.3413654618473896) internal successors, (668), 502 states have internal predecessors, (668), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 698 transitions. [2024-11-13 15:27:09,744 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 698 transitions. Word has length 74 [2024-11-13 15:27:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:09,744 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 698 transitions. [2024-11-13 15:27:09,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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-13 15:27:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 698 transitions. [2024-11-13 15:27:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:09,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:09,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, 1, 1, 1, 1, 1] [2024-11-13 15:27:09,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 15:27:09,746 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:09,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:09,747 INFO L85 PathProgramCache]: Analyzing trace with hash -826976691, now seen corresponding path program 1 times [2024-11-13 15:27:09,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:09,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314271302] [2024-11-13 15:27:09,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:09,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:10,211 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-13 15:27:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314271302] [2024-11-13 15:27:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314271302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:10,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:10,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:27:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196631487] [2024-11-13 15:27:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:10,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:27:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:27:10,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:27:10,213 INFO L87 Difference]: Start difference. First operand 521 states and 698 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-13 15:27:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:11,005 INFO L93 Difference]: Finished difference Result 1021 states and 1378 transitions. [2024-11-13 15:27:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:27:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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 74 [2024-11-13 15:27:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:11,009 INFO L225 Difference]: With dead ends: 1021 [2024-11-13 15:27:11,010 INFO L226 Difference]: Without dead ends: 533 [2024-11-13 15:27:11,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:27:11,011 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 17 mSDsluCounter, 4980 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5534 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:11,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5534 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:27:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-13 15:27:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 519. [2024-11-13 15:27:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 496 states have (on average 1.340725806451613) internal successors, (665), 500 states have internal predecessors, (665), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 695 transitions. [2024-11-13 15:27:11,027 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 695 transitions. Word has length 74 [2024-11-13 15:27:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 695 transitions. [2024-11-13 15:27:11,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-13 15:27:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 695 transitions. [2024-11-13 15:27:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:11,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:11,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, 1, 1] [2024-11-13 15:27:11,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 15:27:11,029 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:11,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1233465825, now seen corresponding path program 1 times [2024-11-13 15:27:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:11,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386822490] [2024-11-13 15:27:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:11,356 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-13 15:27:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386822490] [2024-11-13 15:27:11,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386822490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:11,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:11,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:27:11,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524731144] [2024-11-13 15:27:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:11,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:27:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:27:11,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:27:11,358 INFO L87 Difference]: Start difference. First operand 519 states and 695 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-13 15:27:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:11,996 INFO L93 Difference]: Finished difference Result 1014 states and 1367 transitions. [2024-11-13 15:27:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:27:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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 74 [2024-11-13 15:27:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:11,999 INFO L225 Difference]: With dead ends: 1014 [2024-11-13 15:27:11,999 INFO L226 Difference]: Without dead ends: 528 [2024-11-13 15:27:12,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:27:12,002 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 48 mSDsluCounter, 3975 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:12,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4529 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:27:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-13 15:27:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 517. [2024-11-13 15:27:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 494 states have (on average 1.3400809716599191) internal successors, (662), 498 states have internal predecessors, (662), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 692 transitions. [2024-11-13 15:27:12,021 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 692 transitions. Word has length 74 [2024-11-13 15:27:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:12,022 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 692 transitions. [2024-11-13 15:27:12,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-13 15:27:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 692 transitions. [2024-11-13 15:27:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:12,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:12,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:27:12,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 15:27:12,024 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:12,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1647374805, now seen corresponding path program 1 times [2024-11-13 15:27:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:12,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432601952] [2024-11-13 15:27:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:12,408 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-13 15:27:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432601952] [2024-11-13 15:27:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432601952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:27:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186780678] [2024-11-13 15:27:12,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:12,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:27:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:27:12,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:27:12,410 INFO L87 Difference]: Start difference. First operand 517 states and 692 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-13 15:27:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:13,111 INFO L93 Difference]: Finished difference Result 1019 states and 1371 transitions. [2024-11-13 15:27:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:27:13,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 74 [2024-11-13 15:27:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:13,115 INFO L225 Difference]: With dead ends: 1019 [2024-11-13 15:27:13,115 INFO L226 Difference]: Without dead ends: 535 [2024-11-13 15:27:13,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:27:13,116 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 46 mSDsluCounter, 4559 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 5130 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:13,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 5130 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:27:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-13 15:27:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 517. [2024-11-13 15:27:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 494 states have (on average 1.3400809716599191) internal successors, (662), 498 states have internal predecessors, (662), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 692 transitions. [2024-11-13 15:27:13,150 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 692 transitions. Word has length 74 [2024-11-13 15:27:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:13,151 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 692 transitions. [2024-11-13 15:27:13,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-13 15:27:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 692 transitions. [2024-11-13 15:27:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:13,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:13,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:27:13,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 15:27:13,152 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2138619335, now seen corresponding path program 1 times [2024-11-13 15:27:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914714144] [2024-11-13 15:27:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:13,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:13,853 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-13 15:27:13,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914714144] [2024-11-13 15:27:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914714144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:13,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:13,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:27:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809413349] [2024-11-13 15:27:13,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:13,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:27:13,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:13,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:27:13,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:27:13,856 INFO L87 Difference]: Start difference. First operand 517 states and 692 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-13 15:27:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:27:15,113 INFO L93 Difference]: Finished difference Result 1027 states and 1386 transitions. [2024-11-13 15:27:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:27:15,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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 74 [2024-11-13 15:27:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:27:15,117 INFO L225 Difference]: With dead ends: 1027 [2024-11-13 15:27:15,117 INFO L226 Difference]: Without dead ends: 543 [2024-11-13 15:27:15,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:27:15,118 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 27 mSDsluCounter, 5443 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5984 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:27:15,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5984 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 15:27:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-13 15:27:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 527. [2024-11-13 15:27:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 504 states have (on average 1.3392857142857142) internal successors, (675), 508 states have internal predecessors, (675), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:27:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 705 transitions. [2024-11-13 15:27:15,139 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 705 transitions. Word has length 74 [2024-11-13 15:27:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:27:15,140 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 705 transitions. [2024-11-13 15:27:15,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-13 15:27:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 705 transitions. [2024-11-13 15:27:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:27:15,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:27:15,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:27:15,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 15:27:15,141 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:27:15,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:27:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1022734624, now seen corresponding path program 1 times [2024-11-13 15:27:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:27:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742145618] [2024-11-13 15:27:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:27:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:16,928 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-13 15:27:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:27:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742145618] [2024-11-13 15:27:16,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742145618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:27:16,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:27:16,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:27:16,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431498011] [2024-11-13 15:27:16,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:27:16,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:27:16,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:27:16,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:27:16,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:27:16,930 INFO L87 Difference]: Start difference. First operand 527 states and 705 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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-13 15:27:22,695 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-13 15:27:26,704 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-13 15:27:30,714 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-13 15:27:34,720 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-13 15:27:38,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:27:42,740 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-13 15:27:46,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:27:50,762 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-13 15:27:54,776 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-13 15:27:58,778 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-13 15:28:02,781 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-13 15:28:06,790 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-13 15:28:10,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:28:14,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:28:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:14,937 INFO L93 Difference]: Finished difference Result 1032 states and 1391 transitions. [2024-11-13 15:28:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:28:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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 74 [2024-11-13 15:28:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:28:14,940 INFO L225 Difference]: With dead ends: 1032 [2024-11-13 15:28:14,940 INFO L226 Difference]: Without dead ends: 538 [2024-11-13 15:28:14,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:28:14,942 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 21 mSDsluCounter, 5930 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6476 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:28:14,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6476 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1099 Invalid, 13 Unknown, 0 Unchecked, 58.0s Time] [2024-11-13 15:28:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-13 15:28:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 531. [2024-11-13 15:28:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 508 states have (on average 1.3385826771653544) internal successors, (680), 512 states have internal predecessors, (680), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:28:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 710 transitions. [2024-11-13 15:28:14,962 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 710 transitions. Word has length 74 [2024-11-13 15:28:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:28:14,962 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 710 transitions. [2024-11-13 15:28:14,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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-13 15:28:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 710 transitions. [2024-11-13 15:28:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:28:14,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:28:14,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:14,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-13 15:28:14,964 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:28:14,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1597381305, now seen corresponding path program 1 times [2024-11-13 15:28:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:14,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481814795] [2024-11-13 15:28:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:14,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:15,375 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-13 15:28:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481814795] [2024-11-13 15:28:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481814795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:28:15,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:28:15,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:28:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912153709] [2024-11-13 15:28:15,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:28:15,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:28:15,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:15,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:28:15,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:28:15,378 INFO L87 Difference]: Start difference. First operand 531 states and 710 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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-13 15:28:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:28:16,575 INFO L93 Difference]: Finished difference Result 1099 states and 1481 transitions. [2024-11-13 15:28:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:28:16,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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 74 [2024-11-13 15:28:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:28:16,579 INFO L225 Difference]: With dead ends: 1099 [2024-11-13 15:28:16,579 INFO L226 Difference]: Without dead ends: 601 [2024-11-13 15:28:16,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:28:16,581 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 151 mSDsluCounter, 3474 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 4004 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:28:16,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 4004 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:28:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-13 15:28:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 536. [2024-11-13 15:28:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 513 states have (on average 1.341130604288499) internal successors, (688), 517 states have internal predecessors, (688), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:28:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 718 transitions. [2024-11-13 15:28:16,601 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 718 transitions. Word has length 74 [2024-11-13 15:28:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:28:16,601 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 718 transitions. [2024-11-13 15:28:16,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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-13 15:28:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2024-11-13 15:28:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:28:16,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:28:16,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:28:16,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 15:28:16,603 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:28:16,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:28:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1178309664, now seen corresponding path program 1 times [2024-11-13 15:28:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:28:16,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110886938] [2024-11-13 15:28:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:28:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:28:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:28:39,418 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-13 15:28:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:28:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110886938] [2024-11-13 15:28:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110886938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:28:39,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:28:39,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:28:39,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044777156] [2024-11-13 15:28:39,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:28:39,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:28:39,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:28:39,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:28:39,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=90, Unknown=1, NotChecked=0, Total=110 [2024-11-13 15:28:39,424 INFO L87 Difference]: Start difference. First operand 536 states and 718 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-13 15:28:44,362 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-13 15:28:48,365 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-13 15:28:51,073 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-13 15:28:53,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:28:57,341 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-13 15:29:01,422 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-13 15:29:05,429 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-13 15:29:09,433 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-13 15:29:13,438 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-13 15:29:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:14,993 INFO L93 Difference]: Finished difference Result 1045 states and 1409 transitions. [2024-11-13 15:29:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:29:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 74 [2024-11-13 15:29:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:14,997 INFO L225 Difference]: With dead ends: 1045 [2024-11-13 15:29:14,997 INFO L226 Difference]: Without dead ends: 542 [2024-11-13 15:29:14,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=19, Invalid=90, Unknown=1, NotChecked=0, Total=110 [2024-11-13 15:29:14,999 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 17 mSDsluCounter, 4458 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5010 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:14,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5010 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 803 Invalid, 7 Unknown, 0 Unchecked, 35.5s Time] [2024-11-13 15:29:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-13 15:29:15,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2024-11-13 15:29:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 516 states have (on average 1.3391472868217054) internal successors, (691), 520 states have internal predecessors, (691), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:29:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 721 transitions. [2024-11-13 15:29:15,019 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 721 transitions. Word has length 74 [2024-11-13 15:29:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:15,020 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 721 transitions. [2024-11-13 15:29:15,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-13 15:29:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 721 transitions. [2024-11-13 15:29:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:29:15,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:15,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:29:15,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 15:29:15,022 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:29:15,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1301336889, now seen corresponding path program 1 times [2024-11-13 15:29:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:15,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854013071] [2024-11-13 15:29:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:29:15,895 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-13 15:29:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:29:15,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854013071] [2024-11-13 15:29:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854013071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:29:15,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:29:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 15:29:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658299055] [2024-11-13 15:29:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:29:15,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:29:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:29:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:29:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:29:15,897 INFO L87 Difference]: Start difference. First operand 539 states and 721 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 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-13 15:29:17,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:29:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:29:18,466 INFO L93 Difference]: Finished difference Result 1073 states and 1449 transitions. [2024-11-13 15:29:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:29:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 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 74 [2024-11-13 15:29:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:29:18,471 INFO L225 Difference]: With dead ends: 1073 [2024-11-13 15:29:18,471 INFO L226 Difference]: Without dead ends: 567 [2024-11-13 15:29:18,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:29:18,473 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 37 mSDsluCounter, 6446 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 6990 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:29:18,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 6990 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 15:29:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-13 15:29:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 551. [2024-11-13 15:29:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 528 states have (on average 1.3409090909090908) internal successors, (708), 532 states have internal predecessors, (708), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 15:29:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 738 transitions. [2024-11-13 15:29:18,495 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 738 transitions. Word has length 74 [2024-11-13 15:29:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:29:18,496 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 738 transitions. [2024-11-13 15:29:18,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 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-13 15:29:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 738 transitions. [2024-11-13 15:29:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:29:18,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:29:18,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:29:18,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 15:29:18,497 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-13 15:29:18,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:29:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1037006496, now seen corresponding path program 1 times [2024-11-13 15:29:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:29:18,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120183994] [2024-11-13 15:29:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:29:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:29:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat