./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:31:26,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:31:26,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:31:26,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:31:26,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:31:26,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:31:26,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:31:26,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:31:26,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:31:26,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:31:26,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:31:26,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:31:26,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:31:26,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:31:26,525 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:31:26,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:31:26,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:31:26,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:31:26,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:31:26,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:31:26,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:31:26,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:31:26,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:31:26,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:31:26,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:31:26,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:31:26,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:31:26,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:31:26,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:31:26,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:31:26,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:31:26,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:31:26,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:31:26,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:31:26,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:31:26,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:31:26,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:31:26,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:31:26,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:31:26,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:31:26,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:31:26,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:31:26,536 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-10-11 16:31:26,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:31:26,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:31:26,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:31:26,876 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:31:26,876 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:31:26,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-11 16:31:28,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:31:28,721 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:31:28,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-10-11 16:31:28,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32842df6f/95008c235e5942c1b3210844d5ba27c4/FLAG8ebb27e7f [2024-10-11 16:31:28,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32842df6f/95008c235e5942c1b3210844d5ba27c4 [2024-10-11 16:31:28,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:31:28,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:31:28,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:31:28,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:31:28,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:31:28,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:31:28" (1/1) ... [2024-10-11 16:31:28,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7900cd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:28, skipping insertion in model container [2024-10-11 16:31:28,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:31:28" (1/1) ... [2024-10-11 16:31:29,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:31:29,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2024-10-11 16:31:29,645 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2024-10-11 16:31:29,744 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2024-10-11 16:31:29,745 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2024-10-11 16:31:29,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:31:29,777 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:31:29,822 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2024-10-11 16:31:29,825 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2024-10-11 16:31:29,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2024-10-11 16:31:29,879 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2024-10-11 16:31:29,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:31:29,971 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:31:29,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29 WrapperNode [2024-10-11 16:31:29,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:31:29,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:31:29,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:31:29,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:31:29,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,100 INFO L138 Inliner]: procedures = 282, calls = 286, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1468 [2024-10-11 16:31:30,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:31:30,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:31:30,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:31:30,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:31:30,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,218 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 3, 34, 220]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 2, 4, 49]. [2024-10-11 16:31:30,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:31:30,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:31:30,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:31:30,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:31:30,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (1/1) ... [2024-10-11 16:31:30,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:31:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:31:30,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:31:30,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:31:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:31:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:31:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:31:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:31:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 16:31:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:31:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-11 16:31:30,451 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-11 16:31:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:31:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:31:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:31:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 16:31:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:31:30,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:31:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:31:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:31:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:31:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 16:31:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:31:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:31:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-11 16:31:30,458 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-11 16:31:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:31:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:31:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:31:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 16:31:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-11 16:31:30,458 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-11 16:31:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:31:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:31:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:31:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 16:31:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:31:30,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:31:30,754 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:31:30,756 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:31:32,248 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-10-11 16:31:32,248 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:31:32,299 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:31:32,300 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 16:31:32,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:31:32 BoogieIcfgContainer [2024-10-11 16:31:32,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:31:32,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:31:32,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:31:32,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:31:32,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:31:28" (1/3) ... [2024-10-11 16:31:32,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a58de01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:31:32, skipping insertion in model container [2024-10-11 16:31:32,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:29" (2/3) ... [2024-10-11 16:31:32,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a58de01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:31:32, skipping insertion in model container [2024-10-11 16:31:32,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:31:32" (3/3) ... [2024-10-11 16:31:32,308 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2024-10-11 16:31:32,325 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:31:32,325 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 16:31:32,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:31:32,413 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;@751f82d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:31:32,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 16:31:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 16:31:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 16:31:32,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:32,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:32,428 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-10-11 16:31:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 141968546, now seen corresponding path program 1 times [2024-10-11 16:31:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184613479] [2024-10-11 16:31:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:32,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:32,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184613479] [2024-10-11 16:31:32,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184613479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:32,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:32,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:31:32,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555871295] [2024-10-11 16:31:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:32,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:31:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:31:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:31:32,707 INFO L87 Difference]: Start difference. First operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-11 16:31:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:32,846 INFO L93 Difference]: Finished difference Result 845 states and 1360 transitions. [2024-10-11 16:31:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:31:32,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-11 16:31:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:32,865 INFO L225 Difference]: With dead ends: 845 [2024-10-11 16:31:32,866 INFO L226 Difference]: Without dead ends: 420 [2024-10-11 16:31:32,872 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-10-11 16:31:32,878 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:32,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:31:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-11 16:31:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-11 16:31:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 399 states have (on average 1.443609022556391) internal successors, (576), 404 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 601 transitions. [2024-10-11 16:31:32,958 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 601 transitions. Word has length 7 [2024-10-11 16:31:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:32,959 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 601 transitions. [2024-10-11 16:31:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-11 16:31:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 601 transitions. [2024-10-11 16:31:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 16:31:32,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:32,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:32,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:31:32,961 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-10-11 16:31:32,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash 750725892, now seen corresponding path program 1 times [2024-10-11 16:31:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347415100] [2024-10-11 16:31:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:33,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:33,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347415100] [2024-10-11 16:31:33,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347415100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:33,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:31:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161108977] [2024-10-11 16:31:33,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:31:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:31:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:33,180 INFO L87 Difference]: Start difference. First operand 420 states and 601 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-11 16:31:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:33,394 INFO L93 Difference]: Finished difference Result 1027 states and 1478 transitions. [2024-10-11 16:31:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:31:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-11 16:31:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:33,400 INFO L225 Difference]: With dead ends: 1027 [2024-10-11 16:31:33,401 INFO L226 Difference]: Without dead ends: 818 [2024-10-11 16:31:33,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 16:31:33,404 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 554 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:33,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1826 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:31:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-11 16:31:33,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 422. [2024-10-11 16:31:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4413965087281795) internal successors, (578), 406 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2024-10-11 16:31:33,446 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 9 [2024-10-11 16:31:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:33,447 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2024-10-11 16:31:33,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-11 16:31:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2024-10-11 16:31:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:31:33,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:33,449 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] [2024-10-11 16:31:33,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:31:33,450 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-10-11 16:31:33,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash 992376086, now seen corresponding path program 1 times [2024-10-11 16:31:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252950694] [2024-10-11 16:31:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:33,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:33,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252950694] [2024-10-11 16:31:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252950694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:33,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:31:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104106560] [2024-10-11 16:31:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:33,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:31:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:33,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:31:33,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:33,766 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-11 16:31:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:33,883 INFO L93 Difference]: Finished difference Result 844 states and 1206 transitions. [2024-10-11 16:31:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:31:33,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-11 16:31:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:33,887 INFO L225 Difference]: With dead ends: 844 [2024-10-11 16:31:33,889 INFO L226 Difference]: Without dead ends: 425 [2024-10-11 16:31:33,890 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-10-11 16:31:33,891 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 106 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:33,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1607 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:31:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-11 16:31:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2024-10-11 16:31:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4239401496259352) internal successors, (571), 406 states have internal predecessors, (571), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 596 transitions. [2024-10-11 16:31:33,914 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 596 transitions. Word has length 64 [2024-10-11 16:31:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:33,915 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 596 transitions. [2024-10-11 16:31:33,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-11 16:31:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 596 transitions. [2024-10-11 16:31:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:31:33,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:33,920 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] [2024-10-11 16:31:33,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:31:33,921 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-10-11 16:31:33,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 696880968, now seen corresponding path program 1 times [2024-10-11 16:31:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:33,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355670087] [2024-10-11 16:31:33,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:34,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:34,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355670087] [2024-10-11 16:31:34,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355670087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:34,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:34,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:31:34,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636845572] [2024-10-11 16:31:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:34,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:31:34,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:34,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:31:34,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:34,117 INFO L87 Difference]: Start difference. First operand 422 states and 596 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-11 16:31:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:34,207 INFO L93 Difference]: Finished difference Result 793 states and 1114 transitions. [2024-10-11 16:31:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:31:34,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-11 16:31:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:34,214 INFO L225 Difference]: With dead ends: 793 [2024-10-11 16:31:34,214 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 16:31:34,216 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-10-11 16:31:34,218 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 9 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:34,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1456 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:31:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 16:31:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-10-11 16:31:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3909348441926346) internal successors, (491), 358 states have internal predecessors, (491), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 516 transitions. [2024-10-11 16:31:34,233 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 516 transitions. Word has length 64 [2024-10-11 16:31:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:34,234 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 516 transitions. [2024-10-11 16:31:34,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-11 16:31:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 516 transitions. [2024-10-11 16:31:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:31:34,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:34,238 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] [2024-10-11 16:31:34,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:31:34,240 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-10-11 16:31:34,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2068688266, now seen corresponding path program 1 times [2024-10-11 16:31:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:34,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557846567] [2024-10-11 16:31:34,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:34,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557846567] [2024-10-11 16:31:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557846567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:31:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849443309] [2024-10-11 16:31:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:34,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:31:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:34,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:31:34,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:31:34,733 INFO L87 Difference]: Start difference. First operand 374 states and 516 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-10-11 16:31:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:35,166 INFO L93 Difference]: Finished difference Result 750 states and 1037 transitions. [2024-10-11 16:31:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:31:35,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 64 [2024-10-11 16:31:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:35,169 INFO L225 Difference]: With dead ends: 750 [2024-10-11 16:31:35,170 INFO L226 Difference]: Without dead ends: 379 [2024-10-11 16:31:35,171 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-10-11 16:31:35,172 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 10 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:35,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2171 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:31:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-11 16:31:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2024-10-11 16:31:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.388732394366197) internal successors, (493), 360 states have internal predecessors, (493), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 518 transitions. [2024-10-11 16:31:35,198 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 518 transitions. Word has length 64 [2024-10-11 16:31:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:35,199 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 518 transitions. [2024-10-11 16:31:35,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-10-11 16:31:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 518 transitions. [2024-10-11 16:31:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:31:35,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:35,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:35,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:31:35,205 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-10-11 16:31:35,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:35,206 INFO L85 PathProgramCache]: Analyzing trace with hash -437125107, now seen corresponding path program 1 times [2024-10-11 16:31:35,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:35,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349047437] [2024-10-11 16:31:35,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:35,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:35,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349047437] [2024-10-11 16:31:35,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349047437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:35,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:31:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676320170] [2024-10-11 16:31:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:35,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:31:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:35,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:31:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:35,502 INFO L87 Difference]: Start difference. First operand 376 states and 518 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-11 16:31:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:35,656 INFO L93 Difference]: Finished difference Result 749 states and 1033 transitions. [2024-10-11 16:31:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:31:35,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-11 16:31:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:35,659 INFO L225 Difference]: With dead ends: 749 [2024-10-11 16:31:35,659 INFO L226 Difference]: Without dead ends: 376 [2024-10-11 16:31:35,660 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-10-11 16:31:35,661 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 13 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:35,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1368 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:31:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-11 16:31:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-10-11 16:31:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.3859154929577464) internal successors, (492), 360 states have internal predecessors, (492), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 517 transitions. [2024-10-11 16:31:35,677 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 517 transitions. Word has length 65 [2024-10-11 16:31:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:35,677 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 517 transitions. [2024-10-11 16:31:35,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-11 16:31:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 517 transitions. [2024-10-11 16:31:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:31:35,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:35,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:35,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:31:35,680 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-10-11 16:31:35,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2023236473, now seen corresponding path program 1 times [2024-10-11 16:31:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223006269] [2024-10-11 16:31:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223006269] [2024-10-11 16:31:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223006269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:35,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:35,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:31:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953088692] [2024-10-11 16:31:35,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:35,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:31:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:35,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:31:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:35,930 INFO L87 Difference]: Start difference. First operand 376 states and 517 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-10-11 16:31:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:36,290 INFO L93 Difference]: Finished difference Result 754 states and 1039 transitions. [2024-10-11 16:31:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:31:36,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 65 [2024-10-11 16:31:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:36,293 INFO L225 Difference]: With dead ends: 754 [2024-10-11 16:31:36,294 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 16:31:36,297 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-10-11 16:31:36,298 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 10 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:36,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2605 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:31:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 16:31:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2024-10-11 16:31:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 359 states have (on average 1.384401114206128) internal successors, (497), 364 states have internal predecessors, (497), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 522 transitions. [2024-10-11 16:31:36,311 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 522 transitions. Word has length 65 [2024-10-11 16:31:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:36,312 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 522 transitions. [2024-10-11 16:31:36,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-10-11 16:31:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 522 transitions. [2024-10-11 16:31:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:31:36,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:36,313 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-10-11 16:31:36,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:31:36,313 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-10-11 16:31:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash 946071343, now seen corresponding path program 1 times [2024-10-11 16:31:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309369354] [2024-10-11 16:31:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309369354] [2024-10-11 16:31:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309369354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:36,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:31:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840421304] [2024-10-11 16:31:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:31:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:31:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:31:36,619 INFO L87 Difference]: Start difference. First operand 380 states and 522 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-10-11 16:31:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:36,873 INFO L93 Difference]: Finished difference Result 760 states and 1046 transitions. [2024-10-11 16:31:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:31:36,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-10-11 16:31:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:36,876 INFO L225 Difference]: With dead ends: 760 [2024-10-11 16:31:36,876 INFO L226 Difference]: Without dead ends: 383 [2024-10-11 16:31:36,877 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-10-11 16:31:36,878 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 4 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:36,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1788 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:31:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-11 16:31:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-10-11 16:31:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.3812154696132597) internal successors, (500), 367 states have internal predecessors, (500), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 525 transitions. [2024-10-11 16:31:36,890 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 525 transitions. Word has length 66 [2024-10-11 16:31:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:36,890 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 525 transitions. [2024-10-11 16:31:36,890 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-10-11 16:31:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 525 transitions. [2024-10-11 16:31:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:31:36,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:36,891 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-10-11 16:31:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:31:36,892 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-10-11 16:31:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1827898922, now seen corresponding path program 1 times [2024-10-11 16:31:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112982534] [2024-10-11 16:31:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:37,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:37,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112982534] [2024-10-11 16:31:37,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112982534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:37,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:37,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:31:37,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17525807] [2024-10-11 16:31:37,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:37,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:37,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:37,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:37,293 INFO L87 Difference]: Start difference. First operand 383 states and 525 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-10-11 16:31:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:37,816 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2024-10-11 16:31:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 16:31:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-10-11 16:31:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:37,819 INFO L225 Difference]: With dead ends: 776 [2024-10-11 16:31:37,819 INFO L226 Difference]: Without dead ends: 396 [2024-10-11 16:31:37,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:31:37,820 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 30 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:37,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3520 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:31:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-11 16:31:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2024-10-11 16:31:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.381720430107527) internal successors, (514), 377 states have internal predecessors, (514), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions. [2024-10-11 16:31:37,831 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 66 [2024-10-11 16:31:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:37,832 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 539 transitions. [2024-10-11 16:31:37,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-10-11 16:31:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions. [2024-10-11 16:31:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:31:37,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:37,833 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-10-11 16:31:37,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:31:37,833 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-10-11 16:31:37,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash -215227921, now seen corresponding path program 1 times [2024-10-11 16:31:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268761469] [2024-10-11 16:31:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:38,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:38,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268761469] [2024-10-11 16:31:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268761469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:38,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:38,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:31:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455543806] [2024-10-11 16:31:38,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:31:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:38,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:31:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:31:38,307 INFO L87 Difference]: Start difference. First operand 393 states and 539 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-10-11 16:31:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:38,746 INFO L93 Difference]: Finished difference Result 786 states and 1080 transitions. [2024-10-11 16:31:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:31:38,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-10-11 16:31:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:38,750 INFO L225 Difference]: With dead ends: 786 [2024-10-11 16:31:38,750 INFO L226 Difference]: Without dead ends: 396 [2024-10-11 16:31:38,751 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-10-11 16:31:38,751 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 23 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:38,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3083 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:31:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-11 16:31:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-11 16:31:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-11 16:31:38,763 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 66 [2024-10-11 16:31:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:38,764 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-11 16:31:38,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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-10-11 16:31:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-11 16:31:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:31:38,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:38,765 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-10-11 16:31:38,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:31:38,765 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-10-11 16:31:38,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1927888144, now seen corresponding path program 1 times [2024-10-11 16:31:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:38,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143569763] [2024-10-11 16:31:38,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143569763] [2024-10-11 16:31:39,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143569763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:39,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:39,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:31:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929296143] [2024-10-11 16:31:39,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:39,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:31:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:31:39,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:39,110 INFO L87 Difference]: Start difference. First operand 396 states and 542 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-10-11 16:31:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:39,502 INFO L93 Difference]: Finished difference Result 794 states and 1089 transitions. [2024-10-11 16:31:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:31:39,503 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-10-11 16:31:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:39,505 INFO L225 Difference]: With dead ends: 794 [2024-10-11 16:31:39,505 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 16:31:39,506 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-10-11 16:31:39,507 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 9 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:39,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2611 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:31:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 16:31:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 396. [2024-10-11 16:31:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-11 16:31:39,519 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 67 [2024-10-11 16:31:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:39,520 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-11 16:31:39,520 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-10-11 16:31:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-11 16:31:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:31:39,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:39,521 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-10-11 16:31:39,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:31:39,522 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-10-11 16:31:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1191157692, now seen corresponding path program 1 times [2024-10-11 16:31:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:39,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845042070] [2024-10-11 16:31:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845042070] [2024-10-11 16:31:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845042070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:40,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:31:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220925451] [2024-10-11 16:31:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:40,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:40,043 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-10-11 16:31:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:40,986 INFO L93 Difference]: Finished difference Result 1144 states and 1578 transitions. [2024-10-11 16:31:40,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:40,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-10-11 16:31:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:40,990 INFO L225 Difference]: With dead ends: 1144 [2024-10-11 16:31:40,990 INFO L226 Difference]: Without dead ends: 751 [2024-10-11 16:31:40,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:31:40,992 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 598 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:40,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2935 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 16:31:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-11 16:31:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 427. [2024-10-11 16:31:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 406 states have (on average 1.3497536945812807) internal successors, (548), 411 states have internal predecessors, (548), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 573 transitions. [2024-10-11 16:31:41,011 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 573 transitions. Word has length 67 [2024-10-11 16:31:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:41,012 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 573 transitions. [2024-10-11 16:31:41,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-10-11 16:31:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 573 transitions. [2024-10-11 16:31:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 16:31:41,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:41,013 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-10-11 16:31:41,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:31:41,013 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-10-11 16:31:41,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1668996667, now seen corresponding path program 1 times [2024-10-11 16:31:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:41,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700988320] [2024-10-11 16:31:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:41,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:41,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-10-11 16:31:41,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:41,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700988320] [2024-10-11 16:31:41,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700988320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:41,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:41,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:31:41,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785566922] [2024-10-11 16:31:41,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:41,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:41,344 INFO L87 Difference]: Start difference. First operand 427 states and 573 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-10-11 16:31:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:41,709 INFO L93 Difference]: Finished difference Result 830 states and 1126 transitions. [2024-10-11 16:31:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 16:31:41,710 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-10-11 16:31:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:41,714 INFO L225 Difference]: With dead ends: 830 [2024-10-11 16:31:41,714 INFO L226 Difference]: Without dead ends: 437 [2024-10-11 16:31:41,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:41,717 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 16 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:41,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3105 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:31:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-11 16:31:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 430. [2024-10-11 16:31:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-11 16:31:41,733 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-11 16:31:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:41,733 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-11 16:31:41,734 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-10-11 16:31:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-11 16:31:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 16:31:41,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:41,735 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-10-11 16:31:41,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:31:41,735 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-10-11 16:31:41,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -488729825, now seen corresponding path program 1 times [2024-10-11 16:31:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716342044] [2024-10-11 16:31:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716342044] [2024-10-11 16:31:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716342044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:42,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:31:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675651604] [2024-10-11 16:31:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:42,003 INFO L87 Difference]: Start difference. First operand 430 states and 577 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-10-11 16:31:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:42,544 INFO L93 Difference]: Finished difference Result 836 states and 1134 transitions. [2024-10-11 16:31:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:42,545 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-10-11 16:31:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:42,547 INFO L225 Difference]: With dead ends: 836 [2024-10-11 16:31:42,547 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 16:31:42,548 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-10-11 16:31:42,549 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 26 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:42,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3456 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 16:31:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-10-11 16:31:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-11 16:31:42,568 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-11 16:31:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:42,569 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-11 16:31:42,569 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-10-11 16:31:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-11 16:31:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:31:42,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:42,570 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-10-11 16:31:42,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:31:42,570 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-10-11 16:31:42,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash -29765440, now seen corresponding path program 1 times [2024-10-11 16:31:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:42,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698217174] [2024-10-11 16:31:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:42,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:42,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:42,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698217174] [2024-10-11 16:31:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698217174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:42,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:31:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288201598] [2024-10-11 16:31:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:42,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:42,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:42,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:42,886 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-11 16:31:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:43,407 INFO L93 Difference]: Finished difference Result 842 states and 1143 transitions. [2024-10-11 16:31:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-11 16:31:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:43,411 INFO L225 Difference]: With dead ends: 842 [2024-10-11 16:31:43,411 INFO L226 Difference]: Without dead ends: 446 [2024-10-11 16:31:43,413 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-10-11 16:31:43,414 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 22 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3511 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:43,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3511 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-11 16:31:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2024-10-11 16:31:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 419 states have (on average 1.3460620525059666) internal successors, (564), 424 states have internal predecessors, (564), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 589 transitions. [2024-10-11 16:31:43,431 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 589 transitions. Word has length 69 [2024-10-11 16:31:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:43,432 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 589 transitions. [2024-10-11 16:31:43,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-11 16:31:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2024-10-11 16:31:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:31:43,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:43,433 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-10-11 16:31:43,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:31:43,434 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-10-11 16:31:43,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1800190044, now seen corresponding path program 1 times [2024-10-11 16:31:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:43,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666188745] [2024-10-11 16:31:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:43,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:43,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666188745] [2024-10-11 16:31:43,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666188745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:43,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:43,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:31:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656056878] [2024-10-11 16:31:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:43,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:43,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:43,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:43,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:43,779 INFO L87 Difference]: Start difference. First operand 440 states and 589 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-11 16:31:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:44,309 INFO L93 Difference]: Finished difference Result 862 states and 1167 transitions. [2024-10-11 16:31:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:44,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-11 16:31:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:44,313 INFO L225 Difference]: With dead ends: 862 [2024-10-11 16:31:44,313 INFO L226 Difference]: Without dead ends: 456 [2024-10-11 16:31:44,314 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-10-11 16:31:44,315 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 13 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:44,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3919 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-11 16:31:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 443. [2024-10-11 16:31:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3459715639810426) internal successors, (568), 427 states have internal predecessors, (568), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 593 transitions. [2024-10-11 16:31:44,331 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 593 transitions. Word has length 69 [2024-10-11 16:31:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:44,331 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 593 transitions. [2024-10-11 16:31:44,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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-10-11 16:31:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 593 transitions. [2024-10-11 16:31:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:31:44,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:44,332 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-10-11 16:31:44,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 16:31:44,333 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-10-11 16:31:44,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 302137308, now seen corresponding path program 1 times [2024-10-11 16:31:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652863665] [2024-10-11 16:31:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:44,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:44,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652863665] [2024-10-11 16:31:44,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652863665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:31:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087119778] [2024-10-11 16:31:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:44,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:31:44,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:44,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:31:44,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:44,692 INFO L87 Difference]: Start difference. First operand 443 states and 593 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-10-11 16:31:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:45,062 INFO L93 Difference]: Finished difference Result 857 states and 1157 transitions. [2024-10-11 16:31:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:31:45,063 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-10-11 16:31:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:45,067 INFO L225 Difference]: With dead ends: 857 [2024-10-11 16:31:45,067 INFO L226 Difference]: Without dead ends: 448 [2024-10-11 16:31:45,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:45,068 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 7 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:45,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2635 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:31:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-11 16:31:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-10-11 16:31:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3436018957345972) internal successors, (567), 427 states have internal predecessors, (567), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 592 transitions. [2024-10-11 16:31:45,083 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 592 transitions. Word has length 69 [2024-10-11 16:31:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:45,083 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 592 transitions. [2024-10-11 16:31:45,083 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-10-11 16:31:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 592 transitions. [2024-10-11 16:31:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:31:45,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:45,084 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-10-11 16:31:45,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 16:31:45,085 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-10-11 16:31:45,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1914808309, now seen corresponding path program 1 times [2024-10-11 16:31:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121571213] [2024-10-11 16:31:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:45,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121571213] [2024-10-11 16:31:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121571213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:45,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:31:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053693201] [2024-10-11 16:31:45,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:45,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:31:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:45,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:31:45,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:45,339 INFO L87 Difference]: Start difference. First operand 443 states and 592 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-10-11 16:31:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:45,998 INFO L93 Difference]: Finished difference Result 855 states and 1155 transitions. [2024-10-11 16:31:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:31:46,000 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-10-11 16:31:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:46,002 INFO L225 Difference]: With dead ends: 855 [2024-10-11 16:31:46,002 INFO L226 Difference]: Without dead ends: 446 [2024-10-11 16:31:46,004 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-10-11 16:31:46,004 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 4 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:46,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2594 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:31:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-11 16:31:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-10-11 16:31:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 425 states have (on average 1.3411764705882352) internal successors, (570), 430 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 595 transitions. [2024-10-11 16:31:46,021 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 595 transitions. Word has length 69 [2024-10-11 16:31:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:46,022 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 595 transitions. [2024-10-11 16:31:46,022 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-10-11 16:31:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 595 transitions. [2024-10-11 16:31:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:46,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:46,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] [2024-10-11 16:31:46,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 16:31:46,024 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-10-11 16:31:46,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 48213054, now seen corresponding path program 1 times [2024-10-11 16:31:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:46,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513324003] [2024-10-11 16:31:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:46,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:46,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513324003] [2024-10-11 16:31:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513324003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:46,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:46,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:31:46,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014639091] [2024-10-11 16:31:46,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:46,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:46,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:46,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:46,518 INFO L87 Difference]: Start difference. First operand 446 states and 595 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-11 16:31:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:47,137 INFO L93 Difference]: Finished difference Result 870 states and 1174 transitions. [2024-10-11 16:31:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-11 16:31:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:47,140 INFO L225 Difference]: With dead ends: 870 [2024-10-11 16:31:47,140 INFO L226 Difference]: Without dead ends: 458 [2024-10-11 16:31:47,141 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-10-11 16:31:47,142 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 9 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3903 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:47,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3903 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:31:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-11 16:31:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2024-10-11 16:31:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.3403263403263403) internal successors, (575), 434 states have internal predecessors, (575), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 600 transitions. [2024-10-11 16:31:47,157 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 600 transitions. Word has length 70 [2024-10-11 16:31:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:47,157 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 600 transitions. [2024-10-11 16:31:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-11 16:31:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2024-10-11 16:31:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:47,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:47,158 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-10-11 16:31:47,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 16:31:47,158 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-10-11 16:31:47,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1976786731, now seen corresponding path program 1 times [2024-10-11 16:31:47,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:47,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775095031] [2024-10-11 16:31:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:47,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775095031] [2024-10-11 16:31:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775095031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:47,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:31:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181363665] [2024-10-11 16:31:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:31:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:31:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:31:47,487 INFO L87 Difference]: Start difference. First operand 450 states and 600 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-11 16:31:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:48,077 INFO L93 Difference]: Finished difference Result 879 states and 1184 transitions. [2024-10-11 16:31:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-11 16:31:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:48,081 INFO L225 Difference]: With dead ends: 879 [2024-10-11 16:31:48,081 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 16:31:48,082 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-10-11 16:31:48,083 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 22 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:48,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4401 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:31:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 16:31:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 453. [2024-10-11 16:31:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.337962962962963) internal successors, (578), 437 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2024-10-11 16:31:48,107 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 70 [2024-10-11 16:31:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:48,108 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2024-10-11 16:31:48,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-11 16:31:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2024-10-11 16:31:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:48,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:48,109 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-10-11 16:31:48,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 16:31:48,109 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-10-11 16:31:48,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 942258210, now seen corresponding path program 1 times [2024-10-11 16:31:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524382794] [2024-10-11 16:31:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:48,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:48,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524382794] [2024-10-11 16:31:48,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524382794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:48,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:48,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:31:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504642020] [2024-10-11 16:31:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:48,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:48,641 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-11 16:31:52,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:31:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:53,160 INFO L93 Difference]: Finished difference Result 878 states and 1180 transitions. [2024-10-11 16:31:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:53,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-11 16:31:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:53,165 INFO L225 Difference]: With dead ends: 878 [2024-10-11 16:31:53,165 INFO L226 Difference]: Without dead ends: 459 [2024-10-11 16:31:53,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:31:53,168 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 33 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:53,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3426 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 16:31:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-11 16:31:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 454. [2024-10-11 16:31:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.3371824480369514) internal successors, (579), 438 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 604 transitions. [2024-10-11 16:31:53,186 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 604 transitions. Word has length 70 [2024-10-11 16:31:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:53,186 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 604 transitions. [2024-10-11 16:31:53,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-10-11 16:31:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 604 transitions. [2024-10-11 16:31:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:53,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:53,187 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-10-11 16:31:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 16:31:53,187 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-10-11 16:31:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash -894204710, now seen corresponding path program 1 times [2024-10-11 16:31:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685914942] [2024-10-11 16:31:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685914942] [2024-10-11 16:31:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685914942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:31:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125422992] [2024-10-11 16:31:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:53,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:53,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:53,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:53,440 INFO L87 Difference]: Start difference. First operand 454 states and 604 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-10-11 16:31:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:53,972 INFO L93 Difference]: Finished difference Result 883 states and 1187 transitions. [2024-10-11 16:31:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:53,974 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-10-11 16:31:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:53,977 INFO L225 Difference]: With dead ends: 883 [2024-10-11 16:31:53,977 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 16:31:53,979 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-10-11 16:31:53,979 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 22 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:53,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3456 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 16:31:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 451. [2024-10-11 16:31:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 430 states have (on average 1.3395348837209302) internal successors, (576), 435 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:31:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 601 transitions. [2024-10-11 16:31:54,002 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 601 transitions. Word has length 70 [2024-10-11 16:31:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:54,002 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 601 transitions. [2024-10-11 16:31:54,003 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-10-11 16:31:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 601 transitions. [2024-10-11 16:31:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:54,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:54,004 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-10-11 16:31:54,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 16:31:54,004 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-10-11 16:31:54,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1497195914, now seen corresponding path program 1 times [2024-10-11 16:31:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:54,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696327629] [2024-10-11 16:31:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:54,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:03,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (let ((.cse2 (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (or (< (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1| (* .cse2 4294967296)) (+ .cse0 |c_ULTIMATE.start_main_~_hj_i~0#1|)) (< 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|) .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296)) (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* .cse2 2147483648))))))) is different from false [2024-10-11 16:32:13,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-10-11 16:32:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696327629] [2024-10-11 16:32:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696327629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:13,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:13,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:32:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346725814] [2024-10-11 16:32:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:32:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:13,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:32:13,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-10-11 16:32:13,477 INFO L87 Difference]: Start difference. First operand 451 states and 601 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-11 16:32:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:14,147 INFO L93 Difference]: Finished difference Result 892 states and 1205 transitions. [2024-10-11 16:32:14,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:32:14,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-11 16:32:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:14,152 INFO L225 Difference]: With dead ends: 892 [2024-10-11 16:32:14,152 INFO L226 Difference]: Without dead ends: 475 [2024-10-11 16:32:14,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-10-11 16:32:14,153 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 41 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:14,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3469 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 0 Unknown, 315 Unchecked, 0.6s Time] [2024-10-11 16:32:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-11 16:32:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 457. [2024-10-11 16:32:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.3394495412844036) internal successors, (584), 441 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 609 transitions. [2024-10-11 16:32:14,173 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 609 transitions. Word has length 70 [2024-10-11 16:32:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:14,173 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 609 transitions. [2024-10-11 16:32:14,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-10-11 16:32:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 609 transitions. [2024-10-11 16:32:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:14,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:14,175 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-10-11 16:32:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 16:32:14,175 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-10-11 16:32:14,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash -794892407, now seen corresponding path program 1 times [2024-10-11 16:32:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319103289] [2024-10-11 16:32:14,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319103289] [2024-10-11 16:32:14,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319103289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:14,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:14,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 16:32:14,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305947261] [2024-10-11 16:32:14,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:14,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:32:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:14,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:32:14,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:32:14,547 INFO L87 Difference]: Start difference. First operand 457 states and 609 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-10-11 16:32:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:15,242 INFO L93 Difference]: Finished difference Result 892 states and 1202 transitions. [2024-10-11 16:32:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 16:32:15,243 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-10-11 16:32:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:15,248 INFO L225 Difference]: With dead ends: 892 [2024-10-11 16:32:15,248 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 16:32:15,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:32:15,249 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 12 mSDsluCounter, 3878 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4368 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:15,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4368 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:32:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 16:32:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 464. [2024-10-11 16:32:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 443 states have (on average 1.3386004514672687) internal successors, (593), 448 states have internal predecessors, (593), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 618 transitions. [2024-10-11 16:32:15,264 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 618 transitions. Word has length 71 [2024-10-11 16:32:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:15,264 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 618 transitions. [2024-10-11 16:32:15,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-10-11 16:32:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 618 transitions. [2024-10-11 16:32:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:15,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:15,266 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-10-11 16:32:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 16:32:15,266 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-10-11 16:32:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash 790204545, now seen corresponding path program 1 times [2024-10-11 16:32:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720011495] [2024-10-11 16:32:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:15,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720011495] [2024-10-11 16:32:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720011495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:32:15,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274151602] [2024-10-11 16:32:15,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:15,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:32:15,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:15,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:32:15,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:32:15,586 INFO L87 Difference]: Start difference. First operand 464 states and 618 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-10-11 16:32:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:16,002 INFO L93 Difference]: Finished difference Result 899 states and 1210 transitions. [2024-10-11 16:32:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:32:16,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-10-11 16:32:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:16,006 INFO L225 Difference]: With dead ends: 899 [2024-10-11 16:32:16,006 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 16:32:16,007 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-10-11 16:32:16,007 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 33 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:16,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3108 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:32:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 16:32:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 461. [2024-10-11 16:32:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 440 states have (on average 1.3386363636363636) internal successors, (589), 445 states have internal predecessors, (589), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 614 transitions. [2024-10-11 16:32:16,022 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 614 transitions. Word has length 71 [2024-10-11 16:32:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:16,022 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 614 transitions. [2024-10-11 16:32:16,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-10-11 16:32:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 614 transitions. [2024-10-11 16:32:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:16,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:16,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] [2024-10-11 16:32:16,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 16:32:16,024 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-10-11 16:32:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1088293983, now seen corresponding path program 1 times [2024-10-11 16:32:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963362833] [2024-10-11 16:32:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:16,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963362833] [2024-10-11 16:32:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963362833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:16,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:16,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:32:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139649331] [2024-10-11 16:32:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:16,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:32:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:32:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:32:16,255 INFO L87 Difference]: Start difference. First operand 461 states and 614 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-10-11 16:32:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:16,583 INFO L93 Difference]: Finished difference Result 889 states and 1195 transitions. [2024-10-11 16:32:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:32:16,584 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-10-11 16:32:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:16,587 INFO L225 Difference]: With dead ends: 889 [2024-10-11 16:32:16,587 INFO L226 Difference]: Without dead ends: 462 [2024-10-11 16:32:16,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:32:16,588 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 45 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:16,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2690 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:32:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-11 16:32:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 458. [2024-10-11 16:32:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 437 states have (on average 1.3386727688787186) internal successors, (585), 442 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 610 transitions. [2024-10-11 16:32:16,603 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 610 transitions. Word has length 71 [2024-10-11 16:32:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:16,604 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 610 transitions. [2024-10-11 16:32:16,604 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-10-11 16:32:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 610 transitions. [2024-10-11 16:32:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:16,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:16,605 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-10-11 16:32:16,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 16:32:16,605 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-10-11 16:32:16,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash 756361631, now seen corresponding path program 1 times [2024-10-11 16:32:16,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:16,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390554730] [2024-10-11 16:32:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390554730] [2024-10-11 16:32:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390554730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 16:32:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18574571] [2024-10-11 16:32:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:17,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:32:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:32:17,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:32:17,003 INFO L87 Difference]: Start difference. First operand 458 states and 610 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-10-11 16:32:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:17,731 INFO L93 Difference]: Finished difference Result 898 states and 1211 transitions. [2024-10-11 16:32:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 16:32:17,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-10-11 16:32:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:17,734 INFO L225 Difference]: With dead ends: 898 [2024-10-11 16:32:17,734 INFO L226 Difference]: Without dead ends: 474 [2024-10-11 16:32:17,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:32:17,735 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 14 mSDsluCounter, 4263 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4736 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:17,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4736 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:32:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-11 16:32:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 459. [2024-10-11 16:32:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3378995433789955) internal successors, (586), 443 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 611 transitions. [2024-10-11 16:32:17,754 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 611 transitions. Word has length 71 [2024-10-11 16:32:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:17,755 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 611 transitions. [2024-10-11 16:32:17,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-10-11 16:32:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 611 transitions. [2024-10-11 16:32:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:17,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:17,756 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-10-11 16:32:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 16:32:17,756 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-10-11 16:32:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2115370497, now seen corresponding path program 1 times [2024-10-11 16:32:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:17,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221577618] [2024-10-11 16:32:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:18,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221577618] [2024-10-11 16:32:18,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221577618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:18,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:32:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573633605] [2024-10-11 16:32:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:18,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:32:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:32:18,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:32:18,063 INFO L87 Difference]: Start difference. First operand 459 states and 611 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-10-11 16:32:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:18,763 INFO L93 Difference]: Finished difference Result 894 states and 1202 transitions. [2024-10-11 16:32:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:32:18,765 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-10-11 16:32:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:18,768 INFO L225 Difference]: With dead ends: 894 [2024-10-11 16:32:18,769 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 16:32:18,770 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-10-11 16:32:18,770 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 8 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:18,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3947 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:32:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 16:32:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 459. [2024-10-11 16:32:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3378995433789955) internal successors, (586), 443 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 611 transitions. [2024-10-11 16:32:18,788 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 611 transitions. Word has length 71 [2024-10-11 16:32:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:18,788 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 611 transitions. [2024-10-11 16:32:18,788 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-10-11 16:32:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 611 transitions. [2024-10-11 16:32:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:18,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:18,789 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-10-11 16:32:18,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 16:32:18,790 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-10-11 16:32:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1990201277, now seen corresponding path program 1 times [2024-10-11 16:32:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:18,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760223200] [2024-10-11 16:32:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:18,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760223200] [2024-10-11 16:32:19,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760223200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:19,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 16:32:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819104818] [2024-10-11 16:32:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:19,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 16:32:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:19,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 16:32:19,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:32:19,234 INFO L87 Difference]: Start difference. First operand 459 states and 611 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-10-11 16:32:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:19,996 INFO L93 Difference]: Finished difference Result 904 states and 1219 transitions. [2024-10-11 16:32:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 16:32:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-10-11 16:32:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:19,999 INFO L225 Difference]: With dead ends: 904 [2024-10-11 16:32:19,999 INFO L226 Difference]: Without dead ends: 479 [2024-10-11 16:32:20,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:32:20,001 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 35 mSDsluCounter, 4676 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 5151 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:20,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 5151 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:32:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-11 16:32:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 468. [2024-10-11 16:32:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 447 states have (on average 1.337807606263982) internal successors, (598), 452 states have internal predecessors, (598), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 623 transitions. [2024-10-11 16:32:20,016 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 623 transitions. Word has length 71 [2024-10-11 16:32:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:20,017 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 623 transitions. [2024-10-11 16:32:20,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-10-11 16:32:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 623 transitions. [2024-10-11 16:32:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:20,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:20,018 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-10-11 16:32:20,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 16:32:20,018 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-10-11 16:32:20,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1457930159, now seen corresponding path program 1 times [2024-10-11 16:32:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:20,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399069614] [2024-10-11 16:32:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:21,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:21,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399069614] [2024-10-11 16:32:21,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399069614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:21,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:21,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:32:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536964360] [2024-10-11 16:32:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:21,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:32:21,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:32:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:32:21,122 INFO L87 Difference]: Start difference. First operand 468 states and 623 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 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-10-11 16:32:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:23,230 INFO L93 Difference]: Finished difference Result 972 states and 1311 transitions. [2024-10-11 16:32:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:32:23,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 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-10-11 16:32:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:23,233 INFO L225 Difference]: With dead ends: 972 [2024-10-11 16:32:23,233 INFO L226 Difference]: Without dead ends: 538 [2024-10-11 16:32:23,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:32:23,235 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 106 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:23,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 4592 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 16:32:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-11 16:32:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 469. [2024-10-11 16:32:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 448 states have (on average 1.3392857142857142) internal successors, (600), 453 states have internal predecessors, (600), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 625 transitions. [2024-10-11 16:32:23,256 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 625 transitions. Word has length 71 [2024-10-11 16:32:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:23,256 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 625 transitions. [2024-10-11 16:32:23,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 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-10-11 16:32:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 625 transitions. [2024-10-11 16:32:23,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:23,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:23,257 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-10-11 16:32:23,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 16:32:23,259 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-10-11 16:32:23,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash 602512357, now seen corresponding path program 1 times [2024-10-11 16:32:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:23,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718239912] [2024-10-11 16:32:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718239912] [2024-10-11 16:32:24,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718239912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:24,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:24,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:32:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40140624] [2024-10-11 16:32:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:24,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:32:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:32:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:32:24,922 INFO L87 Difference]: Start difference. First operand 469 states and 625 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-10-11 16:32:29,205 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-10-11 16:32:32,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:32:38,208 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-10-11 16:32:41,062 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-10-11 16:32:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:41,395 INFO L93 Difference]: Finished difference Result 929 states and 1251 transitions. [2024-10-11 16:32:41,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 16:32:41,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-10-11 16:32:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:41,398 INFO L225 Difference]: With dead ends: 929 [2024-10-11 16:32:41,398 INFO L226 Difference]: Without dead ends: 494 [2024-10-11 16:32:41,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:32:41,400 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 74 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:41,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 3466 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 692 Invalid, 2 Unknown, 0 Unchecked, 16.2s Time] [2024-10-11 16:32:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-11 16:32:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 469. [2024-10-11 16:32:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 448 states have (on average 1.3392857142857142) internal successors, (600), 453 states have internal predecessors, (600), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 625 transitions. [2024-10-11 16:32:41,417 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 625 transitions. Word has length 71 [2024-10-11 16:32:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:41,419 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 625 transitions. [2024-10-11 16:32:41,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-10-11 16:32:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 625 transitions. [2024-10-11 16:32:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 16:32:41,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:41,420 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-10-11 16:32:41,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 16:32:41,420 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-10-11 16:32:41,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 707846777, now seen corresponding path program 1 times [2024-10-11 16:32:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479742433] [2024-10-11 16:32:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479742433] [2024-10-11 16:32:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479742433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:32:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38687438] [2024-10-11 16:32:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:32:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:32:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:32:41,598 INFO L87 Difference]: Start difference. First operand 469 states and 625 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-10-11 16:32:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:41,928 INFO L93 Difference]: Finished difference Result 922 states and 1241 transitions. [2024-10-11 16:32:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:32:41,929 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-10-11 16:32:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:41,931 INFO L225 Difference]: With dead ends: 922 [2024-10-11 16:32:41,931 INFO L226 Difference]: Without dead ends: 487 [2024-10-11 16:32:41,932 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-10-11 16:32:41,933 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 82 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:41,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2193 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:32:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-11 16:32:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 471. [2024-10-11 16:32:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 450 states have (on average 1.3377777777777777) internal successors, (602), 455 states have internal predecessors, (602), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 627 transitions. [2024-10-11 16:32:41,947 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 627 transitions. Word has length 71 [2024-10-11 16:32:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:41,947 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 627 transitions. [2024-10-11 16:32:41,947 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-10-11 16:32:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 627 transitions. [2024-10-11 16:32:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 16:32:41,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:41,948 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-10-11 16:32:41,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 16:32:41,949 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-10-11 16:32:41,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2008193782, now seen corresponding path program 1 times [2024-10-11 16:32:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:41,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295979002] [2024-10-11 16:32:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:42,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:42,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295979002] [2024-10-11 16:32:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295979002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 16:32:42,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618046464] [2024-10-11 16:32:42,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:42,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:32:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:32:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:32:42,447 INFO L87 Difference]: Start difference. First operand 471 states and 627 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-10-11 16:32:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:43,128 INFO L93 Difference]: Finished difference Result 922 states and 1240 transitions. [2024-10-11 16:32:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 16:32:43,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-10-11 16:32:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:43,131 INFO L225 Difference]: With dead ends: 922 [2024-10-11 16:32:43,131 INFO L226 Difference]: Without dead ends: 485 [2024-10-11 16:32:43,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-10-11 16:32:43,132 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 58 mSDsluCounter, 3443 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3928 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:43,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3928 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:32:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-11 16:32:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 471. [2024-10-11 16:32:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 450 states have (on average 1.3355555555555556) internal successors, (601), 455 states have internal predecessors, (601), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 626 transitions. [2024-10-11 16:32:43,147 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 626 transitions. Word has length 72 [2024-10-11 16:32:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:43,147 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 626 transitions. [2024-10-11 16:32:43,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-10-11 16:32:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 626 transitions. [2024-10-11 16:32:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 16:32:43,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:43,149 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-10-11 16:32:43,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 16:32:43,149 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-10-11 16:32:43,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:43,149 INFO L85 PathProgramCache]: Analyzing trace with hash 767497187, now seen corresponding path program 1 times [2024-10-11 16:32:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:43,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183867600] [2024-10-11 16:32:43,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:43,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183867600] [2024-10-11 16:32:43,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183867600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:43,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:43,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:32:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838458268] [2024-10-11 16:32:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:43,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:32:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:43,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:32:43,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:32:43,691 INFO L87 Difference]: Start difference. First operand 471 states and 626 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-10-11 16:32:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:44,171 INFO L93 Difference]: Finished difference Result 904 states and 1215 transitions. [2024-10-11 16:32:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:32:44,172 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-10-11 16:32:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:44,174 INFO L225 Difference]: With dead ends: 904 [2024-10-11 16:32:44,174 INFO L226 Difference]: Without dead ends: 467 [2024-10-11 16:32:44,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:32:44,176 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 8 mSDsluCounter, 3804 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4290 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:44,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4290 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:32:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-11 16:32:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 457. [2024-10-11 16:32:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.341743119266055) internal successors, (585), 441 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 610 transitions. [2024-10-11 16:32:44,190 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 610 transitions. Word has length 72 [2024-10-11 16:32:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:44,190 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 610 transitions. [2024-10-11 16:32:44,190 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-10-11 16:32:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 610 transitions. [2024-10-11 16:32:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 16:32:44,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:44,191 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-10-11 16:32:44,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 16:32:44,191 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-10-11 16:32:44,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1712149366, now seen corresponding path program 1 times [2024-10-11 16:32:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295582032] [2024-10-11 16:32:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295582032] [2024-10-11 16:32:44,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295582032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:44,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:44,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:32:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616569076] [2024-10-11 16:32:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:44,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:32:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:44,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:32:44,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:32:44,515 INFO L87 Difference]: Start difference. First operand 457 states and 610 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-10-11 16:32:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:44,968 INFO L93 Difference]: Finished difference Result 896 states and 1205 transitions. [2024-10-11 16:32:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:32:44,968 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-10-11 16:32:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:44,971 INFO L225 Difference]: With dead ends: 896 [2024-10-11 16:32:44,971 INFO L226 Difference]: Without dead ends: 473 [2024-10-11 16:32:44,972 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-10-11 16:32:44,972 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 9 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3924 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:44,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3924 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:32:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-11 16:32:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 468. [2024-10-11 16:32:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 447 states have (on average 1.3355704697986577) internal successors, (597), 452 states have internal predecessors, (597), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 622 transitions. [2024-10-11 16:32:44,986 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 622 transitions. Word has length 72 [2024-10-11 16:32:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:44,987 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 622 transitions. [2024-10-11 16:32:44,987 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-10-11 16:32:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 622 transitions. [2024-10-11 16:32:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 16:32:44,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:44,988 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-10-11 16:32:44,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 16:32:44,988 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-10-11 16:32:44,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1528213650, now seen corresponding path program 1 times [2024-10-11 16:32:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:44,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116020786] [2024-10-11 16:32:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:45,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116020786] [2024-10-11 16:32:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116020786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:45,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 16:32:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857971647] [2024-10-11 16:32:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:45,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 16:32:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:45,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 16:32:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:32:45,341 INFO L87 Difference]: Start difference. First operand 468 states and 622 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-10-11 16:32:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:32:45,939 INFO L93 Difference]: Finished difference Result 917 states and 1231 transitions. [2024-10-11 16:32:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 16:32:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-10-11 16:32:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:32:45,942 INFO L225 Difference]: With dead ends: 917 [2024-10-11 16:32:45,942 INFO L226 Difference]: Without dead ends: 483 [2024-10-11 16:32:45,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:32:45,943 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 13 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4781 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:32:45,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4781 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:32:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-11 16:32:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2024-10-11 16:32:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 452 states have (on average 1.334070796460177) internal successors, (603), 457 states have internal predecessors, (603), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:32:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 628 transitions. [2024-10-11 16:32:45,956 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 628 transitions. Word has length 72 [2024-10-11 16:32:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:32:45,957 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 628 transitions. [2024-10-11 16:32:45,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-10-11 16:32:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 628 transitions. [2024-10-11 16:32:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 16:32:45,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:32:45,958 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-10-11 16:32:45,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 16:32:45,958 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-10-11 16:32:45,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:32:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1163958860, now seen corresponding path program 1 times [2024-10-11 16:32:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:32:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137992797] [2024-10-11 16:32:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:32:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:32:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:46,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:46,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137992797] [2024-10-11 16:32:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137992797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 16:32:46,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931374828] [2024-10-11 16:32:46,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:46,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 16:32:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:46,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 16:32:46,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:32:46,344 INFO L87 Difference]: Start difference. First operand 473 states and 628 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 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)